Conference proceeding
Efficient algorithm for local-bound-preserving remapping in ALE methods
NUMERICAL MATHEMATICS AND ADVANCED APPLICATIONS, PROCEEDINGS, pp.358-367
01 Jan 2004
Abstract
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.
Metrics
3 Record Views
Details
- Title
- Efficient algorithm for local-bound-preserving remapping in ALE methods
- Creators
- R GarimellaM KucharikM Shashkov
- Contributors
- M Feistauer (Editor)Dolejsi (Editor)K Najzar (Editor)
- Publication Details
- NUMERICAL MATHEMATICS AND ADVANCED APPLICATIONS, PROCEEDINGS, pp.358-367
- Conference
- NUMERICAL MATHEMATICS AND ADVANCED APPLICATIONS
- Publisher
- Springer Nature
- Number of pages
- 10
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Mathematics
- Identifiers
- 991021861862904721
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Mathematics, Applied