Projection methods for solving large sparse eigenvalue problems

We present a unified approach to several methods for computing eigenvalues and eigenvectors of large sparse matrices. The methods considered are projection methods, i.e. Galerkin type methods, and include the most commonly used algorithms for solving large sparse eigenproblems like the Lanczos algor...

Full description

Saved in:
Bibliographic Details
Main Author: Saad, Youcef
Format: Book Chapter
Language:English
Subjects:
Approximate Problem
Invariant Subspace
Krylov Subspace
Lanczos Algorithm
Projection Method
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a unified approach to several methods for computing eigenvalues and eigenvectors of large sparse matrices. The methods considered are projection methods, i.e. Galerkin type methods, and include the most commonly used algorithms for solving large sparse eigenproblems like the Lanczos algorithm, Arnoldi's method and the subspace iteration. We first derive some a priori error bounds for general projection methods, in terms of the distance of the exact eigenvector from the subspace of approximation. Then this distance is estimated for some typical methods, particularly those for unsymmetric problems.
ISSN:0075-8434
1617-9692
DOI:10.1007/BFb0062098