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

Adaptive Multiresolution Methods: Practical issues on Data Structures, Implementation and Parallelization

Abstract: The concept of fully adaptive multiresolution finite volume schemes has been developed and investigated during the past decade. Here grid adaptation is realized by performing a multiscale decomposition of the discrete data at hand. By means of hard thresholding the resulting multiscale data are compressed. From the remaining data a locally refined grid is constructed.The aim of the present work is to give a self-contained overview on the construction of an appropriate multiresolution analysis using biorthogona… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
26
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(26 citation statements)
references
References 61 publications
0
26
0
Order By: Relevance
“…To account for a changing load due to grid adaptation, we perform rebalancing after each adaptation. For more details on the parallelization concept and its realization as well as performance studies, we refer to [13,14].…”
Section: Parallelizationmentioning
confidence: 99%
See 1 more Smart Citation
“…To account for a changing load due to grid adaptation, we perform rebalancing after each adaptation. For more details on the parallelization concept and its realization as well as performance studies, we refer to [13,14].…”
Section: Parallelizationmentioning
confidence: 99%
“…On the contrary, they have been designed as one program package to efficiently solve aerodynamic problems with a wide variation of scales. Recently, this solver has been parallelized on distributed memory architectures using Message Passing Interface [13,14]. For load-balancing, we use the concept of space-filling curves [15].…”
Section: Introductionmentioning
confidence: 99%
“…The encoding of tree structures usually relies either on hash-tables of keys which refers directly to the positions of the nodes [11] either on real tree structures built with pointers. In Fortran, these pointers can be emulated due to tables of indices [60].…”
Section: Six-dimensional Adaptive Hierarchical Basis For Vlasov Equatmentioning
confidence: 99%
“…Such refinement is often associated with finite volume methods [40,52,60]. We can distinguish two different approaches among AMR methods: in patch-based AMR the data structure is a collection of grids of varying sizes and accuracies, which are embedded within each other [42,56], whereas in the fully-threaded tree AMR in which the points or cells, or groups thereof, are stored in the nodes or leaves of a large tree structure [11,36,52,53,60]. We use the latter method.…”
mentioning
confidence: 99%
See 1 more Smart Citation