Article ID Journal Published Year Pages File Type
9662495 Computers & Mathematics with Applications 2005 11 Pages PDF
Abstract
A central problem in the Jacobi-Davidson method is to expand a projection subspace by solving a certain correction equation. It has been commonly accepted that the correction equation always has a solution. However, it is proved in this paper that this is not true. Conditions are given to decide when it has a unique solution or many solutions or no solution. A refined Jacobi-Davidson method is proposed to overcome the possible nonconvergence of Ritz vectors by computing certain refined approximation eigenvectors from the subspace. A corresponding correction equation is derived for the refined method. Numerical experiments are conducted and efficiency of the refined method is confirmed.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,