On short recurrence Krylov type methods for linear systems with many right-hand sides

详细信息    查看全文

• 作者：Somaiyeh Rashedi^a ; ^{s_rashedi_t@yahoo.com" class="auth_mail" title="E-mail the corresponding author} ; Ghodrat Ebadi^a ; ^{ghodrat_ebadi@yahoo.com" class="auth_mail" title="E-mail the corresponding author} ; Sebastian Birk^b ; ^{birk@math.uni-wuppertal.de" class="auth_mail" title="E-mail the corresponding author} ; Andreas Frommer^b ; ^{frommer@math.uni-wuppertal.de" class="auth_mail" title="E-mail the corresponding author}
• 关键词：65F10 ; 65F30 ; 65F50 ; 65H10
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2016
• 出版时间：July 2016
• 年：2016
• 卷：300
• 期：Complete
• 页码：18-29
• 全文大小：614 K

文摘

Block and global Krylov subspace methods have been proposed as methods adapted to the situation where one iteratively solves systems with the same matrix and several right hand sides. These methods are advantageous, since they allow to cast the major part of the arithmetic in terms of matrix-block vector products, and since, in the block case, they take their iterates from a potentially richer subspace. In this paper we consider the most established Krylov subspace methods which rely on short recurrences, i.e. BiCG, QMR and BiCGStab. We propose modifications of their block variants which increase numerical stability, thus at least partly curing a problem previously observed by several authors. Moreover, we develop modifications of the “global” variants which almost halve the number of matrix–vector multiplications. We present a discussion as well as numerical evidence which both indicate that the additional work present in the block methods can be substantial, and that the new “economic” versions of the “global” BiCG and QMR method can be considered as good alternatives to the BiCGStab variants.