arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.02068math.NAcs.NA
收藏

Lanczos算法什么时候能准确计算?

When does the Lanczos algorithm compute exactly?

Dorota Šimonová, Petr Tichý

摘要:

在理论上,Lanczos算法生成相应Krylov子空间的正交基。然而,在有限精度算法中,计算的Lanczos向量的正交性和线性独立性通常很快就会丢失。在本文中,我们研究了一类矩阵和起始向量具有一个特殊的非零结构,保证精确计算的Lanczos算法时,浮点运算满足IEEE 754标准。类似的结果也制定了一个变种的共轭梯度法,然后产生几乎精确的结果。将所得结果推广到Arnoldi算法、非对称Lanczos算法、Golub-Kahan双对角化算法、块Lanczos算法及其相应的求解线性系的算法。

英文摘要:

In theory, the Lanczos algorithm generates an orthogonal basis of the corresponding Krylov subspace. However, in finite precision arithmetic, the orthogonality and linear independence of the computed Lanczos vectors is usually lost quickly. In this paper we study a class of matrices and starting vectors having a special nonzero structure that guarantees exact computations of the Lanczos algorithm whenever floating point arithmetic satisfying the IEEE 754 standard is used. Analogous results are formulated also for a variant of the conjugate gradient method that produces then almost exact results. The results are extended to the Arnoldi algorithm, the nonsymmetric Lanczos algorithm, the Golub-Kahan bidiagonalization, the block-Lanczos algorithm and their counterparts for solving linear systems.

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

↑