Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Inverse iteration is widely used to compute the eigenvectors of a matrix once accurate eigenvalues are known. We discuss various issues involved in any implementation of inverse iteration for real, symmetric matrices. Current implementations resort to reorthogonalization when eigenvalues agree to more than three digits relative to the norm. Such reorthogonalization can have unexpected consequences. Indeed, as we show in this paper, the implementations in EISPACK and LAPACK may fail. We illustrate with both theoretical and empirical failures.
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
James Lee Hafner
Journal of Number Theory
Charles Micchelli
Journal of Approximation Theory