A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems

The block Arnoldi method is one of the most commonly used techniques for large eigenproblems. In this paper, we exploit certain modified Ritz vectors to take the place of Ritz vectors in the thick-restarted block Arnoldi algorithm, and propose a modified thick-restarted block Arnoldi algorithm for l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & mathematics with applications (1987) Ročník 60; číslo 3; s. 873 - 889
Hlavní autoři: Jiang, Wei, Wu, Gang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.08.2010
Témata:
Algorithms
Block Arnoldi
Blocking
Computation
Computer simulation
Iterative methods
Krylov subspace
Mathematical analysis
Mathematical models
Modified Ritz vector
Ritz vector
Subspace iteration
Subspaces
Thick-restarting
Vectors (mathematics)
Krylov subspace
Thick-restarting
Block Arnoldi
Ritz vector
Modified Ritz vector
Subspace iteration
ISSN:0898-1221, 1873-7668
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!
Popis
Shrnutí:The block Arnoldi method is one of the most commonly used techniques for large eigenproblems. In this paper, we exploit certain modified Ritz vectors to take the place of Ritz vectors in the thick-restarted block Arnoldi algorithm, and propose a modified thick-restarted block Arnoldi algorithm for large eigenproblems. We then consider how to periodically combine the refined subspace iterative method with the modified thick-restarting block Arnoldi algorithm for computing a few dominant eigenpairs of a large matrix. The resulting algorithm is called a Subspace-Block Arnoldi algorithm. Numerical experiments show the efficiency of our new algorithms.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2010.05.034