2009
DOI: 10.1051/proc/2009052
|View full text |Cite
|
Sign up to set email alerts
|

Cost-effective Multiresolution schemes for Shock Computations

Abstract: Abstract. Harten's Multiresolution framework has provided a fruitful environment for the development of adaptive codes for hyperbolic PDEs. The so-called cost-effective alternative [4,8,21] seeks to achieve savings in the computational cost of the underlying numerical technique, but not in the overall memory requirements of the code. Since the data structure of the basic algorithm does not need to be modified, it provides a set of tools that can be easily implemented into existing codes and that can be very us… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…In order to achieve this goal within realistic delay the HPC aspect of the method must be enriched using adaptive mesh refinement. The multiresolution method developed in [5] and further tested and extended in [6] or [11] is currently implemented in this new configuration, where the presence of source terms and integral terms will require special considerations as exemplified for instance in [2].…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…In order to achieve this goal within realistic delay the HPC aspect of the method must be enriched using adaptive mesh refinement. The multiresolution method developed in [5] and further tested and extended in [6] or [11] is currently implemented in this new configuration, where the presence of source terms and integral terms will require special considerations as exemplified for instance in [2].…”
Section: Resultsmentioning
confidence: 99%
“…In practice we choose ∆a = ∆γ. The discretization step ∆γ and the cellular maturity threshold γ s must be chosen so that the interfaces where the speed coefficients (2,3) are discontinuous fall on grid points covering the computational domain of size [N c , 1]. Denoting by N m the number of grid cells by half granulosa cell cycle, we set N γ = 2N m and ∆a = ∆γ = 1/N γ and we introduce the dedicated 2 notations for grid points (a k , γ l ) and mesh centers (a k+1/2 , γ l+1/2 ) a k = k∆a, a k+1/2 = (k + 1/2)∆a, for…”
Section: Discretizationmentioning
confidence: 99%
See 2 more Smart Citations
“…The TE algorithm in [1,11] is based on Harten's Multiresolution Framework (MRF), which provides a set of tools to manage data in a multi-scale setting. In the last two decades, the MRF has been successfully applied in various contexts, and in particular in the design of adaptive schemes for the numerical solution of conservation laws and systems [6][7][8]13]. The TE algorithm follows a strategy similar to that used in the cost-effective schemes described in [7] and used in [6,8,13].…”
Section: Introductionmentioning
confidence: 99%