Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner–outer iterations

59 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Numerical Linear Algebra (2011, methodology): “, 1996) and iterative methods (Makinson and Shah, 1986; Zlatev and Nielsen, 1988) and searching eigenvalues (Bergamaschi and Putti, 2002; Golub et al., 2000).”
Inexact Inverse Iteration for Generalized Eigenvalue Problems (2000, methodology): “Such an inexact technique has been studied for several methods, such as the Davidson and the Lanczos algorithm [2, 5 , 10, 18], the rational Arnoldi algorithm and truncated”
Recent computational developments in Krylov subspace methods for linear systems (2007, methodology): “Thus, Zhang [350] chose q m (ζ) using a polynomial three-term recurrence, while allowing for complex roots.”