A Krylov-Schur Algorithm for Large Eigenproblems

By G. Stewart. SIAM Journal on Matrix Analysis and Applications, 2001

541 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 methods for large eigenvalue problems (2002, unknown): “This is presented in Stewart (2001).”
Chebyshev interpolation for nonlinear eigenvalue problems (2012, methodology): “For the solution of the linearized eigenvalue problems, we have utilized a MATLAB implementation of the Arnoldi algorithm with Krylov-Schur restarting [30].”
A Krylov–Schur approach to the truncated SVD (2012, methodology): “Stewart was able to address these issues, see [29, 30], by introducing a Krylov-Schur method based on a slightly more general decomposition as the basis of the restarted process.”
Krylov-Type Methods for Tensor Computations (2010, unknown): “For matrices the subspaces can be improved using the implicitly restarted Arnoldi (Krylov–Schur) approach [23,30].”
A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity (2006, methodology): “Stewart [23] shows from (2.4) that if ỹi has unit norm, then ‖(A − σI)ỹi‖ |θ̃i − σ |.”
Restarted block-GMRES with deflation of eigenvalues (2005, background): “See [24, 45, 29] for some other related eigenvalue methods.”
Krylov-type methods for tensor computations I (2013, methodology): “For matrices the subspaces can be improved using the implicitly restarted Arnoldi (Krylov– Schur) approach [23, 30].”