An unstructured multigrid method based on geometric smoothness
β Scribed by Edmond Chow
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 378 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.321
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
For nonβMβmatrices, this paper proposes an unstructured multigrid method that only attempts to interpolate in the directions of geometric smoothness. These directions are determined by analysing samples of algebraically smooth error, e. Neighbouring grid points i and j are called smoothly coupled if e~i~ and e~j~ are consistently nearby in value. In addition, these differences may be used to define interpolation weights. These new ideas may be incorporated into the algebraic multigrid method. Test results show that the new method can have much lower grid and operator complexities compared to AMG, leading to lower solve timings. Published in 2003 by John Wiley & Sons, Ltd.
π SIMILAR VOLUMES
Extending multigrid concepts to the calculation of complex compressible flow is usually not straightforward. This is especially true when non-embedded grid hierarchies or volume agglomeration strategies are used to construct a gradation of unstructured grids. In this work, a multigrid method for sol
The relative performance of a nonlinear full approximation storage multigrid algorithm and an equivalent linear multigrid algorithm for solving two different nonlinear problems is investigated. The first case consists of a transient radiation diffusion problem for which an exact linearization is ava
In this paper we introduce and analyse a new Schur complement approximation based on incomplete Gaussian elimination. The approximate Schur complement is used to develop a multigrid method. This multigrid method has an algorithmic structure that is very similar to the algorithmic structure of classi