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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 153; číslo 3; s. 611 - 643
Hlavní autor:	Wu, Gang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Elsevier Inc 14.06.2004 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!