SOLVING THE EIGENVALUES OF SYMMETRIC SPARSE MATRICES APPLYING PARALLELISM
by M. A. Trenas, Maria A. Trenas, R. Asenjo, R. Asenjo, E. L. Zapata, E. L. Zapata
http://www.atc.ctima.uma.es/inv-des/inves/reports/1996/UMA-DAC-96-32.ps.gz
Add To MetaCart
Abstract:
In this work we present a parallelization of Lanczos and Dongarra-Sorensen algorithms. Our trend is to solve the Symmetric Eigenproblem in Sparse Matrices in an efficient way. We have evaluated our results on multiprocessors CrayT3D, and Paramid.
Citations
| 72 | A fully parallel algorithm for the symmetric eigenvalue problem – Dongarra, Sorensen - 1987 |
| 63 | Matrix Computations, second edition – Golub, Loan - 1989 |
| 14 | Sparse Block and Cyclic Data Distributions for Matrix Computations – Asenjo, Romero, et al. - 1994 |
| 3 | Parallel Algorithms for Eigenvalues Computation with Sparse Matrices – Trenas - 1995 |
| 1 | Analysis of Non-Strict Functional – Sur, Bhm |
