New choices of preconditioning matrices for generalized inexact parameterized iterative methods

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:235

Article

Cao, Yang¹  Jiang, Mei-Qun¹  Yao, Lin-Quan^1,2 

[1] Soochow Univ, Sch Math Sci, Suzhou 215006, Jiangsu, Peoples R China

[2] Soochow Univ, Sch Urban Transportat, Suzhou 215021, Jiangsu, Peoples R China

关键词: Saddle point problems;    Iterative method;    Preconditioning;   

DOI  :  10.1016/j.cam.2010.05.054

来源: Elsevier

【 摘 要 】

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. (C) 2010 Elsevier B.V. All rights reserved.

【 授权许可】

Free