NASA NTRS · 19890017268
Numerical solution of large nonsymmetric eigenvalue problems
Abstract
Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.
Keep this discovery
Explore connections, maps & timelines
Saad, Youcef. 1988-11-01. Numerical solution of large nonsymmetric eigenvalue problems. https://searchnasa.com/record/nasa%3A19890017268/numerical-solution-of-large-nonsymmetric-eigenvalue-problems
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.