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.
Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes
School of Mathematical Science, Tongji University(同济大学数学科学学院);Key Laboratory of Intelligent Computing and Applications, Tongji University, Ministry of Education(同济大学教育部智能计算与应用重点实验室)
Adaptive Multilevel Methods for the Maxwell Eigenvalue Problem
School of Mathematical Sciences, Tongji University(同济大学数学科学学院);Key Laboratory of Intelligent Computing and Applications (Tongji University), Ministry of Education(教育部智能计算与应用重点实验室(同济大学))
Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb(萨格勒布大学机械与船舶工程学院);Department of Mathematics, University of Zagreb(萨格勒布大学数学系);MSV sustavi d.o.o.(MSV系统有限责任公司)