.png){kind=icon}
.png){kind=icon}
Return
A minimal subspace residual method for large-scale eigenvalue problems
.png){kind=icon}
PRE
AI
DOI：10.1063/1.478740.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an iterative method for treating extremely large-scale eigenvalue problems. Based on an exact formula and the GMRES method, our approach generates a subspace which has the property that the residual of interior eigenpairs in the subspace is minimized. The result is that the corresponding large matrix is block-diagonalized iteratively. The accuracy of the final eigenpairs of interest is directly controlled by the accuracy of the GMRES procedure. Our method limits the number of Arnoldi iterations involved, and the dimension of the subspace, by including the residual in the subspace and minimizing it at each step of the iteration. (C) 1999 American Institute of Physics. [S0021-9606(99)01516-0].
Keywords:
SYMMETRIC-MATRICES
NUMERICAL-SOLUTION
ALGORITHM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
7.2W
Citations:
23.2W
Organization
No organization information available