A Compact Heart Iteration for Large Eigenvalues Problems  

作　　者：Achiya Dax Achiya Dax(Hydrological Service of Israel, Jerusalem, Israel)

机构地区：[1]Hydrological Service of Israel, Jerusalem, Israel

出　　处：《Advances in Linear Algebra & Matrix Theory》2022年第1期24-38,共15页线性代数与矩阵理论研究进展（英文）

摘　　要：In this paper, we present a compact version of the Heart iteration. One that requires less matrix-vector products per iteration and attains faster convergence. The Heart iteration is a new type of Restarted Krylov methods for calculating peripheral eigenvalues of symmetric matrices. The new framework avoids the Lanczos tridiagonalization process and the use of implicit restarts. This simplifies the restarting mechanism and allows the introduction of several modifications. Convergence is assured by a monotonicity property that pushes the computed Ritz values toward their limits. Numerical experiments illustrate the usefulness of the proposed approach.In this paper, we present a compact version of the Heart iteration. One that requires less matrix-vector products per iteration and attains faster convergence. The Heart iteration is a new type of Restarted Krylov methods for calculating peripheral eigenvalues of symmetric matrices. The new framework avoids the Lanczos tridiagonalization process and the use of implicit restarts. This simplifies the restarting mechanism and allows the introduction of several modifications. Convergence is assured by a monotonicity property that pushes the computed Ritz values toward their limits. Numerical experiments illustrate the usefulness of the proposed approach.

关 键 词：Large Sparse Matrices Restarted Krylov Methods Exterior Eigenvalues Symmetric Matrices MONOTONICITY Starting Vectors 

分 类 号：O17[理学—数学]