Report
Convergence of restarted Krylov subspaces to invariant subspaces
- Abstract:
-
The performance of Krylov subspace eigenvalue algorithms for large matrices can be measured by the angle between a desired invariant subspace and the Krylov subspace. We develop general bounds for this convergence that include the effects of polynomial restarting and impose no restrictions concerning the diagonalizability of the matrix or its degree of non-normality. Associated with a desired set of eigenvalues is a maximum ``reachable invariant subspace'' that can be developed from the given...
Expand abstract
Actions
Authors
Bibliographic Details
- Publisher:
- Unspecified
- Publication date:
- 2001-11-01
Item Description
- UUID:
-
uuid:5e31b399-ec20-4bb8-ace9-3f64ba5870f7
- Local pid:
- oai:eprints.maths.ox.ac.uk:1230
- Deposit date:
- 2011-05-31
Related Items
Terms of use
- Copyright date:
- 2001
If you are the owner of this record, you can report an update to it here: Report update to this record