Show simple item record

dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T23:03:11Z
dc.date.available2004-05-31T23:03:11Z
dc.date.created2000-04en_US
dc.date.issued2000-04-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/1066
dc.description.abstractSorensen'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.extent162357 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4127en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2000-21en_US
dc.titleAn Arnoldi--Schur Algorithm for Large Eigenproblemsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record