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

Jacobi-Davidson方法的一种修改

A modification of the Jacobi-Davidson method

Indian Institute of Science(印度科学学院)

Mashetti Ravibabu

AI总结:

本文提出了一种改进的Jacobi-Davidson方法,通过引入基于最小二乘的修正方程来优化子空间扩展阶段,分析了对称矩阵的收敛性,并通过数值实验验证了方法的计算可行性。

摘要:

Jacobi-Davidson方法在求解大规模稀疏本征值问题的每次迭代中包含两个阶段:子空间扩展和本征对提取。子空间扩展阶段涉及求解修正方程。我们提出了一种修改方法,通过引入一个相关的修正方程,该方法受到最小二乘法的启发。我们称之为改进的Jacobi-Davidson方法。当忽略子空间扩展阶段,如在简化Jacobi-Davidson方法中时,该修改方法称为改进的简化Jacobi-Davidson方法。我们分析了该方法在对称矩阵上的收敛性质。进行了数值实验以检查该方法是否具有计算可行性。

英文摘要:

Each iteration in Jacobi-Davidson method for solving large sparse eigenvalue problems involves two phases, called subspace expansion and eigen pair extraction. The subspace expansion phase involves solving a correction equation. We propose a modification to this by introducing a related correction equation, motivated by the least squares. We call the proposed method as the Modified Jacobi-Davidson Method. When the subspace expansion is ignored as in the Simplified Jacobi- Davidson Method, the modified method is called as Modified Simplified Jacobi-Davidson Method. We analyze the convergence properties of the proposed method for Symmetric matrices. Numerical experiments have been carried out to check whether the method is computationally viable or not.

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

↑