Linear systems with M-matrices often appear in a wide variety of areas. In this paper, we give general preconditioners for solving the systems with nonsingular M-matrix. We show that our preconditioners increase the convergence rate of AOR iterative methods. Numerical results for corresponding preco
A note on preconditioned AOR method for -matrices
โ Scribed by Jae Heon Yun
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 119 KB
- Volume
- 220
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
โฆ Synopsis
for L-matrices,
๐ SIMILAR VOLUMES
have considered the modified AOR method with a preconditioner (I + S ฮฑ ). In this paper, we present a new preconditioner (I + S ฮฑฮฒ ) instead of (I + S ฮฑ ). The comparison theorems and numerical experiments show that the proposed new method can achieve faster convergence than the preconditioner intro
## Abstract In this note, results concerning the eigenvalue distribution and form of the eigenvectors of the constraint preconditioned generalized saddle point matrix and its minimal polynomial are given. These results extend previous ones that appeared in the literature. Copyright ยฉ 2009 John Wile