{"title":"p-Multigrid high-order discontinuous Galerkin solver for three-dimensional compressible turbulent flows","authors":"D. Bulgarini, A. Ghidoni, E. Mantecca, G. Noventa","doi":"10.1016/j.jcp.2025.113766","DOIUrl":null,"url":null,"abstract":"<div><div>The study of turbulent flows through steady-state simulations based on the Reynolds-averaged Navier-Stokes equations and turbulence models can be considered the workhorse in different scientific and industrial applications. Among the different numerical approaches, discontinuous Galerkin methods demonstrated to be perfectly suited for high-order accurate numerical solutions on structured or arbitrary unstructured and non-conforming meshes, and high-performance computing with massively parallel processing. However, their computational cost increases rapidly when the solution is discretized with higher-order polynomial approximations. For this reason, many research efforts have been devoted to overcome this drawback. Literature shows many applications of <em>p</em>-multigrid algorithms for the solution of Euler and Navier-Stokes equations, while few works report the solution of the Reynolds-averaged Navier-Stokes equations with <em>p</em>-multigrid algorithms. In fact, different authors highlighted a lack of performance for the stiffness associated with the discretized RANS equations, and for highly stretched meshes, typically used for an accurate resolution of turbulent boundary layers. This work presents the implementation of an improved <em>p</em>-multigrid algorithm based on the nonlinear full approximation scheme in a discontinuous Galerkin solver for the solution of the three-dimensional and compressible Reynolds-Average Navier-Stokes equations. The performance of the algorithm with different smoothers is compared with the implicit (single-order) time integration on many test cases with different flow conditions, domains, and meshes, showing an average reduction of the computing time around 75% with respect to single-order implicit solvers.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"525 ","pages":"Article 113766"},"PeriodicalIF":3.8000,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002199912500049X","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The study of turbulent flows through steady-state simulations based on the Reynolds-averaged Navier-Stokes equations and turbulence models can be considered the workhorse in different scientific and industrial applications. Among the different numerical approaches, discontinuous Galerkin methods demonstrated to be perfectly suited for high-order accurate numerical solutions on structured or arbitrary unstructured and non-conforming meshes, and high-performance computing with massively parallel processing. However, their computational cost increases rapidly when the solution is discretized with higher-order polynomial approximations. For this reason, many research efforts have been devoted to overcome this drawback. Literature shows many applications of p-multigrid algorithms for the solution of Euler and Navier-Stokes equations, while few works report the solution of the Reynolds-averaged Navier-Stokes equations with p-multigrid algorithms. In fact, different authors highlighted a lack of performance for the stiffness associated with the discretized RANS equations, and for highly stretched meshes, typically used for an accurate resolution of turbulent boundary layers. This work presents the implementation of an improved p-multigrid algorithm based on the nonlinear full approximation scheme in a discontinuous Galerkin solver for the solution of the three-dimensional and compressible Reynolds-Average Navier-Stokes equations. The performance of the algorithm with different smoothers is compared with the implicit (single-order) time integration on many test cases with different flow conditions, domains, and meshes, showing an average reduction of the computing time around 75% with respect to single-order implicit solvers.
期刊介绍:
Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries.
The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.