| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636456 | Applied Mathematics and Computation | 2007 | 8 Pages |
Abstract
In this paper, we present a new restarting method in the Lanczos algorithm for computing a few eigenvalues of the symmetric positive definite eigenvalue problem, AX = λBX, where A and B are large and sparse matrices.The implementation of the algorithm has been tested by numerical examples, the results show that the algorithm converges fast and works with high accuracy.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
H. Saberi Najafi, A. Refahi,