Modified explicitly restarted Lanczos algorithm (Q1299581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Modified explicitly restarted Lanczos algorithm |
scientific article; zbMATH DE number 1328218
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modified explicitly restarted Lanczos algorithm |
scientific article; zbMATH DE number 1328218 |
Statements
Modified explicitly restarted Lanczos algorithm (English)
0 references
23 February 2000
0 references
Convergence acceleration and optimization in computing eigenvectors and eigenvalues of very large sparse matrices is obtained by the modified explicitly restarted Lanczos method. The proposed algorithm can calculate the multiplicities of eigenvalues, the required memory is small, and it can be easily implemented. It can calculate more eigenstates than the Davidson algorithm. Numerical tests are carried out in one-dimensional extended Hubbard chains. Multiplicities of eigenvalues are computed, and convergence is tested.
0 references
numerical examples
0 references
comparison of methods
0 references
convergence acceleration
0 references
eigenvectors
0 references
eigenvalues
0 references
large sparse matrices
0 references
restarted Lanczos method
0 references
algorithm
0 references
Davidson algorithm
0 references
Hubbard chains
0 references
convergence
0 references
