J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
A heuristic argument and supporting numerical results are given to demonstrate that a block Lanczos procedure can be used to compute simultaneously a few of the algebraically largest and smallest eigenvalues and a corresponding eigenspace of a large, sparse, symmetric matrix A. This block procedure can be used, for example, to compute appropriate parameters for iterative schemes used in solving the equation Ax=b. Moreover, if there exists an efficient method for repeatedly solving the equation (A-σI)X=B, this procedure can be used to determine the interior eigenvalues (and corresponding eigenvectors) of A closest to σ. © 1978 BIT Foundations.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
M. Tismenetsky
International Journal of Computer Mathematics
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences