2020
DOI: 10.1016/j.compfluid.2020.104558
|View full text |Cite
|
Sign up to set email alerts
|

p-Multigrid matrix-free discontinuous Galerkin solution strategies for the under-resolved simulation of incompressible turbulent flows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 43 publications
0
16
0
Order By: Relevance
“…The performance of the Newton-Krylov method substantially depends on the preconditioner. In the context of the Jacobian-free implementation, the element-Jacobi preconditioner is arguably the simplest one with acceptable performance for many applications among the low-storage preconditioners, such as the matrix-free LU-SGS (Lower-Upper Symmetric-Gauss-Seidel) preconditioner [53], and p-multigrid preconditioner [54]. In this study, only the element-Jacobi preconditioner is considered and it is updated at the starting stage of each physical time step.…”
Section: Iterative Methodsmentioning
confidence: 99%
“…The performance of the Newton-Krylov method substantially depends on the preconditioner. In the context of the Jacobian-free implementation, the element-Jacobi preconditioner is arguably the simplest one with acceptable performance for many applications among the low-storage preconditioners, such as the matrix-free LU-SGS (Lower-Upper Symmetric-Gauss-Seidel) preconditioner [53], and p-multigrid preconditioner [54]. In this study, only the element-Jacobi preconditioner is considered and it is updated at the starting stage of each physical time step.…”
Section: Iterative Methodsmentioning
confidence: 99%
“…A commonly used ASM preconditioner strategy for DG discretizations consists in employing an ILU decomposition in each subdomain matrix suitably extended to include 3 and 4, respectively the matrix rows of ghost elements, that is, neighbors of local mesh elements that belong to a different subdomain. This implies that the local matrix is extended to encompass the stencil of the DG discretizations, see [43] for additional details. We consider a similar strategy for HHO discretizations: each subdomain matrix is extended to include the matrix rows of ghost faces, that is, faces of the local mesh elements that belong to a different subdomain.…”
Section: Scalabilitymentioning
confidence: 99%
“…The purpose of applying iterative solvers to coarse problems is twofold: on the one hand, a coarser operator translates into a global sparse matrix of smaller size with fewer non-zero entries, resulting in cheaper matrix-vector products; on the other hand, coarse level iterations are best suited to smooth out the low-frequency components of the error, that are hardly damped by fine level iterations. In the context of DG discretizations, p-multilevel solvers have been fruitfully utilized in practical applications, see, e.g., [12,42,43,48,54]. h-, p-and hp-multigrid solvers for DG discretizations of elliptic problems have been considered in [4], where uniform convergence with respect to the number of levels for the W-cycle iteration has been proved, and in [19].…”
Section: Introductionmentioning
confidence: 99%
“…We henceforth refer to them as h-multigrid. In HO-methods, alternatively to mesh-coarsening, we can represent the high-order errors on lower orders, effectively coarsening the polynomial-order p. The resulting p-multigrid has been extensively used for the last decade for elliptic, Euler and compressible Navier-Stokes equations [10,11,12,13], including RANS. Pure h-multigrid has also been used in HOmethods for Navier-Stokes equations [15,16,14].…”
Section: Introductionmentioning
confidence: 99%