Convergence of restarted Krylov subspaces to invariant subspaces
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 concernin...
| Main Authors: | , , |
|---|---|
| פורמט: | Report |
| יצא לאור: |
Unspecified
2001
|