2006
DOI: 10.1007/s10915-006-9102-z
|View full text |Cite
|
Sign up to set email alerts
|

Fully Adaptive Multiscale Schemes for Conservation Laws Employing Locally Varying Time Stepping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
76
0
2

Year Published

2008
2008
2021
2021

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 79 publications
(80 citation statements)
references
References 38 publications
2
76
0
2
Order By: Relevance
“…Work currently in preparation includes other applications of interest that maintain the same essential structure: strong degeneracy of the diffusive terms, but for systems and higher space dimensions (by means of tensor product strategies). Other possible extensions include the use of penalisation methods for complex domains and schemes with local time adaptivity [22,41]. As an observation of a practical nature for readers who may wish to implement the method presented herein, we mention that in order to obtain memory compression, not only the tree data structure is essential, but also the way of navigating inside the data structure, as proposed in [45].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Work currently in preparation includes other applications of interest that maintain the same essential structure: strong degeneracy of the diffusive terms, but for systems and higher space dimensions (by means of tensor product strategies). Other possible extensions include the use of penalisation methods for complex domains and schemes with local time adaptivity [22,41]. As an observation of a practical nature for readers who may wish to implement the method presented herein, we mention that in order to obtain memory compression, not only the tree data structure is essential, but also the way of navigating inside the data structure, as proposed in [45].…”
Section: Discussionmentioning
confidence: 99%
“…Though the version of the multiresolution method of [13] is effective for (1.1), it does not provide memory savings. In contrast to [13], the method presented herein does provide significant memory savings, since the multiresolution representation of the solution is stored in a graded tree [17,22,40,41,45], whose leaves are the finite volumes for which the numerical divergence is computed. This means that the numerical flux is actually evaluated on the borders of these finite volumes.…”
Section: Introductionmentioning
confidence: 99%
“…We mention, for example, [8,29], where it is shown that computational savings in memory requirements can also be obtained by incorporating adequate data structures in the numerical code. This strategy can turn a wavelet-based adaptive scheme into a true adaptive mesh-refinement code (see [25]). In the present paper, the multilevel technique reduces the effective CPU time associated to the computation of the numerical divergence (which is the main time consuming part of the full algorithm) by an average factor of 5.5 for uniform grids with 1536 2 points, of 4 for 1024 2 , and of 3 for 512 2 grid points.…”
Section: Discretization Of the Inviscid Fluxesmentioning
confidence: 99%
“…Nevertheless, the CPU-time can be significantly reduced using the local time stepping algorithm, see e.g. [2,16,25]. In recent years, such numerical schemes have been widely developed for equations which arise in many fluid flows: traffic flows, multi-phase flows, multi-layer flows, etc.…”
Section: Introductionmentioning
confidence: 99%