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

New choices of preconditioning matrices for generalized inexact parameterized iterative methods

โœ Scribed by Yang Cao; Mei-Qun Jiang; Lin-Quan Yao

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
280 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 paper, the methods are modified and some choices of preconditioning matrices are given. These preconditioning matrices have advantages in solving large sparse linear system. Numerical experiments of a model Stokes problem are presented.

๐Ÿ“œ SIMILAR VOLUMES

A new preconditioned AOR iterative metho
A new preconditioned AOR iterative method for -matrices
โœ Hongjuan Wang; Yao-tang Li ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

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