A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides

被引:22
|
作者
Du, L. [1 ]
Sogabe, T. [2 ]
Yu, B. [3 ]
Yamamoto, Y. [4 ]
Zhang, S. -L. [1 ]
机构
[1] Nagoya Univ, Dept Computat Sci & Engn, Chikusa Ku, Nagoya, Aichi 4648603, Japan
[2] Aichi Prefectural Univ, Grad Sch Informat Sci & Technol, Nagakute, Aichi 4801198, Japan
[3] Dalian Univ Technol, Sch Math Sci, Dalian 116024, Liaoning, Peoples R China
[4] Kobe Univ, Dept Comp Sci & Syst Engn, Nada Ku, Kobe, Hyogo 6578501, Japan
关键词
Block method; Multiple right-hand sides; Induced dimension reduction IDR(s); Block IDR(s); CONJUGATE-GRADIENT ALGORITHM; PROJECTION METHODS; BICGSTAB; VARIANT; VERSION; GMRES; CG;
D O I
10.1016/j.cam.2011.02.035
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The IDR(s) based on the induced dimension reduction (IDR) theorem, is a new class of efficient algorithms for large nonsymmetric linear systems. IDR(1) is mathematically equivalent to BiCGStab at the even IDR(1) residuals, and IDR(s) with s > 1 is competitive with most Bi-CG based methods. For these reasons, we extend the IDR(s) to solve large nonsymmetric linear systems with multiple right-hand sides. In this paper, a variant of the IDR theorem is given at first, then the block IDR(s), an extension of IDR(s) based on the variant IDR(s) theorem, is proposed. By analysis, the upper bound on the number of matrix-vector products of block IDR(s) is the same as that of the IDR(s) for a single right-hand side in generic case, i.e., the total number of matrix-vector products of IDR(s) may be m times that of of block IDR(s), where in is the number of right-hand sides. Numerical experiments are presented to show the effectiveness of our proposed method. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:4095 / 4106
页数:12
相关论文
共 50 条