Automatic adaptive grid refinement for the Euler equations
โ Scribed by Berger, M. J.; Jameson, A.
- Book ID
- 115498860
- Publisher
- American Institute of Aeronautics and Astronautics
- Year
- 1985
- Tongue
- English
- Weight
- 944 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0001-1452
- DOI
- 10.2514/3.8951
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented. The algorithm creates an initial uniform mesh and cuts the body out of that mesh. The mesh is then refined based on body curvature. Next, the solution is converged to a steady state usin
Adaptive grid refinement is potentially a very powerful means of dealing with singularities and other types of misbehavior in the solutions of elliptic partial differential equations. Combined with the multilevel iterative technique for solving the matrix equations, the method can be implemented in
The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an N P -hard problem and heuristics are