Algorithmic aspects and computational e$ciency of the global-basis two-level method are investigated in the context of symmetric inde"nite system of equations. The algorithm includes e$cient construction of the global-basis prolongator using Lanczos vectors, predictor}corrector smoothing procedures,
Towards robust two-level methods for indefinite systems
โ Scribed by J. Fish; Y. Qu; A. Suvorov
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 344 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
โฆ Synopsis
We present a black-box two-level solver for inde"nite algebraic linear system of equations arising from the "nite element discretization. Numerical experiments show the applicability of the method to 3D Helmholtz equations and shear banding problems with strain softening.
๐ SIMILAR VOLUMES
A robust two-level solver for high inde"nite system of equations arising from the "nite element discretization is developed. It is shown that the optimal coarse model is spanned by the spectrum of the highest eigenmodes of the smoothing iteration matrix. Convergence studies conducted on a model prol
In this paper, the existence, uniqueness and uniform convergence of the solution of the Carey nonconforming element with non-quasi-uniform partitions is proved for non-self-adjoint and inde"nite secondorder elliptic problems under a minimal regularity assumption. Furthermore, the optimal error estim
Norm-minimizing-type methods for solving large sparse linear systems with symmetric and indefinite coefficient matrices are considered. The Krylov subspace can be generated by either the Lanczos approach, such as the methods MINRES, GMRES and QMR, or by a conjugate-gradient approach. Here, we propos