Application of MRTR method for solving complex symmetric linear systems

被引：1

作者：

Shiode, Akira ^{[1
]}

Abe, Kuniyoshi ^{[2
]}

Fujino, Seiji ^{[3
]}

机构：

[1] Kyushu Univ, Grad Sch Informat Sci & Elect Engn, Fukuoka 812, Japan

[2] Gifu Shotoku Gakuen Univ, Dept Econ & Infomat, Gifu, Japan

[3] Kyushu Univ, Comp & Commun Ctr, Fukuoka, Japan

来源：

SYSTEMS MODELING AND SIMULATION: THEORY AND APPLICATIONS, ASIA SIMULATION CONFERENCE 2006 | 2007年

关键词：

cs-MRTR method; singular systems; minimum residual norm;

D O I：

10.1007/978-4-431-49022-7_22

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The MRTR method has been recognized as an effective iterative method for singular systems of linear equations. The MRTR method is based oil the three-term recurrence formula of the CG method and the algorithm is proven to be mathematically equivalent to the CR method. This paper will describe the algorithm of the cs_MRTR method for solving complex symmetric linear systems, and prove that this method is mathematically equivalent to the COCR method. Numerical experiments indicate that the cs_MRTR method convergences more stably compared with the COCR method.

引用

页码：108 / +

页数：2

共 5 条

[1] Abe K., 1997, JSIAM, V7, P37
[2] VARIATIONAL ITERATIVE METHODS FOR NONSYMMETRIC SYSTEMS OF LINEAR-EQUATIONS
EISENSTAT, SC
ELMAN, HC
SCHULTZ, MH
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1983, 20 (02) : 345 - 357
[3] METHODS OF CONJUGATE GRADIENTS FOR SOLVING LINEAR SYSTEMS
HESTENES, MR
STIEFEL, E
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1952, 49 (06): : 409 - 436
[4] PRECONDITIONED CONJUGATE GRADIENTS FOR SOLVING SINGULAR SYSTEMS
KAASSCHIETER, EF
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1988, 24 (1-2) : 265 - 275
[5] SOGABE T, 2004, P SCAN2004, P107

← 1 →