Efficient algorithm for local-bound-preserving remapping in ale methods
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F03%3A00107060" target="_blank" >RIV/68407700:21340/03:00107060 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Efficient algorithm for local-bound-preserving remapping in ale methods
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GD202%2F03%2FH162" target="_blank" >GD202/03/H162: Advanced topics in physics and chemistry of plasmas</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Numerical Mathematics and Advanced Applications. Proceedings of ENUMATH 2003
ISBN
3-540-21460-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Praha
Event date
Aug 18, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000224551300033