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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Kuchařík, M. Shashkov, and B. Wendroff. An efficient linearity-and-boundpreserving remapping method. Journal of Computational Physics, 188(2):462–471, 2003.
T. J. Barth. Numerical methods for gasdynamic systems on unstructured meshes. In C. Rohde D. Kroner, M. Ohlberger, editor, An introduction to Recent Developments in Theory and Numerics for Conservation Laws, Proceedings of the International School on Theory and Numerics for Conservation Laws, Berlin, 1997. Lecture Notes in Computational Science and Engineering, Springer.
B. Mirtich. Fast and accurate computation of polyhedral mass properties. Journal of Graphics Tools, 1(2):31–50, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garimella, R., Kuchařík, M., Shashkov, M. (2004). Efficient Algorithm for Local-Bound-Preserving Remapping in ALE Methods. In: Feistauer, M., Dolejší, V., Knobloch, P., Najzar, K. (eds) Numerical Mathematics and Advanced Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18775-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-18775-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62288-5
Online ISBN: 978-3-642-18775-9
eBook Packages: Springer Book Archive