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

EPIC:基于预处理和隐式凸性的可证明加速特征值求解器

EPIC: a provable accelerated Eigensolver based on Preconditioning and Implicit Convexity

Nian Shao, Wenbin Chen, Zhaojun Bai

AI总结:

针对对称正定矩阵束的最小特征对求解,该研究利用特征值问题的隐式凸性提出可证明加速的EPIC算法,其收敛速率可媲美尚缺完整证明的LOPCG,并得到数值验证。

摘要:

本文关注对称正定矩阵束的最小特征值及相应特征向量的提取问题。我们揭示了欧几里得空间中特征值问题的隐式凸性,提出了一种基于预处理和隐式凸性的可证明加速特征值求解器(EPIC)。理论分析表明,EPIC具有加速效果,其收敛速率类似于著名的局部最优预处理共轭梯度法(LOPCG)的预期收敛速率。迄今为止,LOPCG预期收敛速率的完整证明仍难以获得。数值结果证实了我们关于EPIC的理论发现。

英文摘要:

This paper is concerned with the extraction of the smallest eigenvalue and the corresponding eigenvector of a symmetric positive definite matrix pencil. We reveal implicit convexity of the eigenvalue problem in Euclidean space. A provable accelerated eigensolver based on preconditioning and implicit convexity (EPIC) is proposed. Theoretical analysis shows the acceleration of EPIC with the rate of convergence resembling the expected rate of convergence of the well-known locally optimal preconditioned conjugate gradient (LOPCG). A complete proof of the expected rate of convergence of LOPCG is elusive so far. Numerical results confirm our theoretical findings of EPIC.

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

↑