A Multigrid Method Based on Incomplete Gaussian Elimination
β Scribed by Arnold Reusken
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 897 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
β¦ Synopsis
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 classical multigrid methods. The resulting method is almost purely algebraic and has interesting robustness properties with respect to variation in problem parameters.
π SIMILAR VOLUMES
## 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__ a
A new multigrid method based on high-order vector finite elements is proposed in this paper. Low-level discretizations in this method are obtained by using low-order vector finite elements for the same mesh. The Gauss-Seidel method is used as a smoother, and a linear equation of lowest level is solv