Efficient Algorithm for Local-Bound-Preserving Remapping in ALE Methods

Rao Garimella (), Milan Kuchařík () and Mikhail Shashkov ()
Additional contact information
Rao Garimella: Los Alamos National Laboratory
Milan Kuchařík: Czech Technical University in Prague
Mikhail Shashkov: Los Alamos National Laboratory

A chapter in Numerical Mathematics and Advanced Applications, 2004, pp 358-367 from Springer

Abstract: Summary The remapping algorithm is an essential part of the ALE (Arbitrary Lagrangian-Eulerian) method. In this talk we present such an algorithm based on linear function reconstruction, approximate integration and mass redistribution.

Keywords: Spherical Function; Local Extremum; Underlying Function; Reconstructed Function; Limited Slope (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18775-9_33

Ordering information: This item can be ordered from
http://www.springer.com/9783642187759

DOI: 10.1007/978-3-642-18775-9_33

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().