The Lanczos algorithm is one of the principal methods for the computation of a small part of the eigenspectrum of large, sparse, real symmetric matrices. A single-vector, explicitly restarted variant of the Lanczos method is proposed in this paper. The algorithm ยฎnds only one eigenpair at a time usi
โฆ LIBER โฆ
Modified explicitly restarted Lanczos algorithm
โ Scribed by G.P. Zhang
- Book ID
- 108314566
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 481 KB
- Volume
- 109
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Explicitly restarted Lanczos algorithms
โ
M. Szularz; J. Weston; M. Clint
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 192 KB
Nested Lanczos: implicitly restarting an
โ
Gorik De Samblanx; Adhemar Bultheel
๐
Article
๐
1998
๐
Springer US
๐
English
โ 157 KB
A refined harmonic Rayleigh-Ritz procedu
โ
Guizhi Chen; Zhongxiao Jia
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 871 KB
A thick-restarted block Arnoldi algorith
โ
Wei Jiang; Gang Wu
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 807 KB
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 thickrestarted block Arnoldi algorithm for la