New implementations of Lanczos method
โ Scribed by C. Baheux
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 432 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we are concerned with the application of the unsynunetnc two sided Lanczos method to systems of first order differential equations and its associated problems; namely generalized eigenproblems and linear systems of equations. The unsymmetric Lanczos method is first used to generate two
Kim, S.K. and A.T. Chronopoulos, A class of Lanczos-like algorithms implemented on parallel Computers, Parallel Computing 17 (1991) 763-778. The Lanczos algorithm is most commonly used in approximating a small number of extreme eigenvalues and eigenvectors for symmetric large sparse matrices. Main
The Lanczos algorithm with a new recursive partitioning method to compute the eigenvalues, in a given specified interval, is presented in this paper. Comparisons have been made respecting the numerical results as well as the CPU-time with that of the Sturm sequence-bisection method.