An Arnoldi--Schur Algorithm for Large Eigenproblems
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T23:03:11Z | |
| dc.date.available | 2004-05-31T23:03:11Z | |
| dc.date.created | 2000-04 | en_US |
| dc.date.issued | 2000-04-25 | en_US |
| dc.description.abstract | Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this paper we introduce a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner. (Also cross-referenced as UMIACS-TR-2000-21) | en_US |
| dc.format.extent | 162357 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1066 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4127 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2000-21 | en_US |
| dc.title | An Arnoldi--Schur Algorithm for Large Eigenproblems | en_US |
| dc.type | Technical Report | en_US |