The alternating-direction iterative method for saddle point problems

被引：9
|
作者：
Peng, Xiao-Fei [2 ,3 ]
Li, Wen [1 ]
机构：
[1] S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
[2] Cent S Univ, Sch Math, Changsha 410083, Peoples R China
[3] S China Normal Univ, Nanhai Coll, Foshan 528225, Peoples R China
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2010年 / 216卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Saddle point problem; Matrix splitting; The alternating-direction iterative method; The optimal parameter; Convergence; HERMITIAN SPLITTING METHODS; DEFINITE LINEAR-SYSTEMS; NUMERICAL-SOLUTION; INEXACT;
D O I：
10.1016/j.amc.2009.12.020
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In the paper, a new alternating-direction iterative method is proposed based on matrix splittings for solving saddle point problems. The convergence analysis for the new method is given. When the better values of parameters are employed, the proposed method has faster convergence rate and less time cost than the Uzawa algorithm with the optimal parameter and the Hermitian and skew-Hermitian splitting iterative method. Numerical examples further show the effectiveness of the method. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码：1845 / 1858
页数：14
相关论文
共 50 条
12345