2020
DOI: 10.48550/arxiv.2009.01133
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Bound-preserving flux limiting for high-order explicit Runge-Kutta time discretizations of hyperbolic conservation laws

Abstract: We introduce a general framework for enforcing local or global inequality constraints in high-order time-stepping methods for a scalar hyperbolic conservation law. The proposed methodology blends an arbitrary Runge-Kutta scheme and a bound-preserving (BP) first-order approximation using two kinds of limiting techniques. The first one is a predictor-corrector method that belongs to the family of flux-corrected transport (FCT) algorithms. The second approach constrains the antidiffusive part of a high-order targ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…The final stage of a general high-order Runge-Kutta method for (3.3) can also be written in the form (3.5) and constrained to produce ū * i ∈ G; see [33] for details.…”
Section: Bound-preserving Time Integrationmentioning
confidence: 99%
See 1 more Smart Citation
“…The final stage of a general high-order Runge-Kutta method for (3.3) can also be written in the form (3.5) and constrained to produce ū * i ∈ G; see [33] for details.…”
Section: Bound-preserving Time Integrationmentioning
confidence: 99%
“…The high-order Runge-Kutta time discretization of (4.1) is recovered in the case α n+1 ij = 1 ∀j ∈ N i \{i}. In the process of flux correction for the final stage (4.17), the IDP property is enforced (as in [33]) using the MCL limiter for f n+1 ij . To prevent a loss of accuracy at this stage, the bounds should be global (as in [33]) or defined using all states u n j that may influence u n+1 i if time integration is performed using the high-order Runge-Kutta scheme.…”
Section: Fully Discrete Implicit Correctionmentioning
confidence: 99%
“…Many problems in nature are described either by ordinary differential equations (ODEs) or partial differential equations (PDEs) and the numerical methods that approximate their solutions should preserve the physical quantities of the underlying problem. To keep the positivity for example Patankar approaches [32,21,28] or adaptive/limiting strategies [25,29] can be found in the literature, while, recently, Ketcheson proposed relaxation Runge-Kutta (RRK) methods to guarantee conservation or stability with respect to any innerproduct norm. In a series of papers, he and collaborators have further extended the relaxation approach to multistep schemes and applied it to different kind of problems, cf.…”
Section: Introductionmentioning
confidence: 99%