2012
DOI: 10.1016/j.apnum.2011.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Adaptation based on interpolation errors for high order mesh refinement methods applied to conservation laws

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0
1

Year Published

2012
2012
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 38 publications
0
12
0
1
Order By: Relevance
“…Our first dynamic test case for the proposed framework is given by the hyperbolic inviscid Burgers equation given by the following initial and boundary conditions 71 :…”
Section: Nonlinear Scalar Conservation Laws: Inviscid Burgers Equationmentioning
confidence: 99%
“…Our first dynamic test case for the proposed framework is given by the hyperbolic inviscid Burgers equation given by the following initial and boundary conditions 71 :…”
Section: Nonlinear Scalar Conservation Laws: Inviscid Burgers Equationmentioning
confidence: 99%
“…Within the Eulerian framework on Cartesian grids, such a problem can be conveniently circumvented by resorting to Adaptive-Mesh-Refinement (AMR) with local time stepping, see e.g. [8,7,4,3,14,45,39,91]. There, the mesh is forced to refine only when and where this is needed, while it is recoarsened as soon as the chosen refinement criterion is no longer satisfied.…”
Section: Two-dimensional Explosion Problemsmentioning
confidence: 99%
“…An alternative to overcome the global CFL condition consists in the development of numerical schemes that allow for time-accurate local time stepping (LTS), where each element has to obey only a less restrictive local CFL stability condition, hence using its own optimal local timestep. Therefore, many efforts have been devoted to the construction of high order accurate Eulerian schemes with time-accurate LTS, developing either discontinuous Galerkin finite element methods [48,42,82,65,53,62,47] or high order accurate finite volume schemes with LTS [8,7,89,16,4,3,14,47,45,39]. The finite volume schemes with LTS adopt mainly classical adaptive mesh refinement (AMR) techniques in space and time or block-clustered local time stepping algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, since the coupling iteration is more rigorous than the TMR approach, this may be inefficient in terms of CPU time and memory requirement for solving largescale problems. In the last few years, high order adaptive mesh refinement has been wildly used for solving hyperbolic equations [16][17][18][19][20]. It is worth mentioning the fifth order adaptive finite difference WENO schemes by Shen and Qiu [17] and the high order adaptive finite volume ADER-WENO scheme by Dumbser et al [19,20].…”
Section: Introductionmentioning
confidence: 99%