Y.Y. Li, K.S. Leung, et al.
J Combin Optim
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.
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022