2013
DOI: 10.1016/j.jcp.2013.05.043
|View full text |Cite
|
Sign up to set email alerts
|

Fast time implicit–explicit discontinuous Galerkin method for the compressible Navier–Stokes equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 39 publications
0
8
0
Order By: Relevance
“…In the nodal representation of the numerical solution, the unknowns are the values of the solution at interpolation points, while in the modal representation, the unknowns are the expansion coefficients in a given basis of the underlying function space [28]. We use an orthonormal and hierarchical modal basis for flexibility reasons [12], [13], [14], [15], [27], [29]. In this study, Gauss-Legendre polynomials are used.…”
Section: Fluid Domainmentioning
confidence: 99%
“…In the nodal representation of the numerical solution, the unknowns are the values of the solution at interpolation points, while in the modal representation, the unknowns are the expansion coefficients in a given basis of the underlying function space [28]. We use an orthonormal and hierarchical modal basis for flexibility reasons [12], [13], [14], [15], [27], [29]. In this study, Gauss-Legendre polynomials are used.…”
Section: Fluid Domainmentioning
confidence: 99%
“…In previous works, various numerical methods have been proposed for fast implicit time integrations. [13][14][15]24) This study employs quadrature simplification by orthogonality (QSO) which was proposed in our previous work 25) to generate a large matrix quickly by simplifying the quadratures using the orthogonality of the basis functions. Although QSO assumes that the flux Jacobians are constant in each cell, it has been shown that the error of this assumption is negligibly small for unsteady flow problems.…”
Section: Implicit Time Integration Schemementioning
confidence: 99%
“…Rasetarinera and Hussaini 12) proposed a matrix-free GMRES to solve the problem of prohibitive storage using the GMRES method. Renac et al 13,14) proposed SIMP p s methods, whereby a large matrix is simplified by approximating the components associated with high-order DOFs. Dolej si and Feistauer 15) developed a semi-implicit method based on the homogeneity of inviscid fluxes.…”
Section: Introductionmentioning
confidence: 99%
“…There has been significant progress in the development of time integrators for high-order spatial operators in the past decades, e.g. the LU-SGS algorithm [70,71], hp-multigrid solvers [72][73][74][75][76], Krylov subspace methods such as GMRES with various preconditioners [77,78] and mixed explicit/implicit approaches [79]. The most used turbulent flow solvers appear to employ a GMRES algorithm with either an ILU, hp-multigrid or a line preconditioner [75].…”
Section: (C) Efficient Time Integration Algorithmsmentioning
confidence: 99%