An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems

A modified m-step Arnoldi algorithm proposed by Jia and Elsner for computing a few selected eigenpairs of large unsymmetric matrices is generalized to its block version. In the new method, we use new modified approximate eigenvectors obtained from a linear combination of Ritz vectors and the wasted...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied mathematics and computation Jg. 153; H. 3; S. 611 - 643
1. Verfasser:	Wu, Gang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Elsevier Inc 14.06.2004 Elsevier
Schlagworte:	Block Arnoldi process Exact sciences and technology Krylov subspace Mathematics Modified approximate eigenvectors Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Orthogonal projection Ritz values Ritz vectors Sciences and techniques of general use Orthogonal projection Block Arnoldi process Ritz values Modified approximate eigenvectors Krylov subspace Ritz vectors Arnoldi algorithm Numerical analysis Approximate method Matrix algebra Applied mathematics Eigenvector Iterative method Eigenvalue problem Block matrix
ISSN:	0096-3003, 1873-5649
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!