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

Positivity-preserving high-order discontinuous Galerkin schemes for Ten-Moment Gaussian closure equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

5
19
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 14 publications
(24 citation statements)
references
References 16 publications
5
19
0
Order By: Relevance
“…Note that, use of such a limiter at the postprocessing does not guaranty the entropy stability. We also use the bound preserving limiter presented in [26], wherever needed. Bound preserving limiter does not increase the entropy (see [8]).…”
Section: Numerical Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Note that, use of such a limiter at the postprocessing does not guaranty the entropy stability. We also use the bound preserving limiter presented in [26], wherever needed. Bound preserving limiter does not increase the entropy (see [8]).…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Following [2,31,26], we consider the following two-dimensional ten-moment Gaussian closure model with source terms:…”
Section: Ten-moment Gaussian Closure Equationsmentioning
confidence: 99%
See 2 more Smart Citations
“…In essence, it is to explore whether or not the range of the high-dimensional function E h is always contained in G: E h (G s+k+1 ) ⊆ G. For some scalar PDEs with linear constraints, for instance, the scalar conservation laws with the constraints linearly defined by maximum principle, a general approach for bound-preserving analysis and design is to exploit certain monotonicity in schemes; see, e.g., [67,14,31]. Yet, for PDE systems especially with nonlinear constraints, there is no unified tool like monotonicity, so that direct and complicated algebraic verification usually has to be performed for each constraint case-by-case for different schemes and different PDEs; see, e.g., [68,38,56,41,66,35,53]. Therefore, the design and analysis of bound-preserving schemes involving nonlinear constraints are highly nontrivial, even for first-order schemes; cf.…”
mentioning
confidence: 99%