arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.04395math.NAcs.NA
收藏

关于具有多个右端向量的线性系统中的短递归Krylov型方法

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

University of Tabriz(大不里士大学);Bergische Universität Wuppertal(伍珀塔尔山岳大学)

Somaiyeh Rashedi, Sebastian Birk, Andreas Frommer, Ghodrat Ebadi

AI总结:

本文研究了适用于多次求解相同矩阵和多个右端向量的Krylov子空间方法,改进了BiCG、QMR和BiCGStab等短递归方法的块变体,提高数值稳定性并减少矩阵向量乘法次数。

摘要:

块状和全局Krylov子空间方法已被提出,适用于迭代求解具有相同矩阵和多个右端向量的系统。这些方法的优势在于将大部分运算转化为矩阵-块向量乘法,并且在块情况下,从更丰富的子空间中获取迭代结果。本文考虑了最常用的Krylov子空间方法,即BiCG、QMR和BiCGStab,提出了其块变体的改进以提高数值稳定性,从而在一定程度上解决之前观察到的问题。此外,我们开发了“全局”变体的改进版本,几乎将矩阵向量乘法次数减半。我们还讨论了数值证据,表明块方法的额外工作量可能显著,而新的“经济”版本的“全局”BiCG和QMR方法可以作为BiCGStab变体的替代方案。

英文摘要:

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 recurrencies, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑