A generalized particle search-locate algorithm for arbitrary grids (Q1357324)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalized particle search-locate algorithm for arbitrary grids |
scientific article; zbMATH DE number 1019291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalized particle search-locate algorithm for arbitrary grids |
scientific article; zbMATH DE number 1019291 |
Statements
A generalized particle search-locate algorithm for arbitrary grids (English)
0 references
20 July 1997
0 references
An iterative algorithm for searching and locating particles in arbitrary two-dimensional meshes is presented. Such algorithms play an essential role in implementing characteristic-Galerkin finite element methods or semi-Lagrangian difference schemes. The algorithm uses the Newton iteration method to invert the map of the mesh element onto a reference element and incorporates a criterion for the movement of the particle from one element to another element of the mesh. Numerical examples for various grids demonstrate the performance, the accuracy and the versatility of the method.
0 references
particle location
0 references
particle search
0 references
characteristic-Galerkin finite element methods
0 references
semi-Lagrangian difference schemes
0 references
Newton iteration method
0 references
0 references
0 references