๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new preconditioned AOR iterative method for -matrices

โœ Scribed by Hongjuan Wang; Yao-tang Li

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
438 KB
Volume
229
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 introduced by Li et al.

๐Ÿ“œ SIMILAR VOLUMES

Preconditioned AOR iterative methods for
Preconditioned AOR iterative methods for -matrices
โœ Li Wang; Yongzhong Song ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 727 KB

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

New choices of preconditioning matrices
New choices of preconditioning matrices for generalized inexact parameterized iterative methods
โœ Yang Cao; Mei-Qun Jiang; Lin-Quan Yao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

For large sparse saddle point problems, Chen and Jiang recently studied a class of generalized inexact parameterized iterative methods (see [F. Chen, Y.-L. Jiang, A generalization of the inexact parameterized Uzawa methods for saddle point problems, Appl. Math. Comput. 206 (2008) 765-771]). In this