A Parallel Algorithm For Computing The Extremal Eigenvalues Of Very Large Sparse Matrices (1998)
| Venue: | Lecture Notes in Computer Science |
| Citations: | 12 - 3 self |
BibTeX
@INPROCEEDINGS{Manne98aparallel,
author = {Fredrik Manne and Ax Bx},
title = {A Parallel Algorithm For Computing The Extremal Eigenvalues Of Very Large Sparse Matrices},
booktitle = {Lecture Notes in Computer Science},
year = {1998},
pages = {332--336},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Quantum mechanics often give rise to problems where one needs to find a few eigenvalues of very large sparse matrices. The size of the matrices is such that it is not possible to store them in main memory but instead they must be generated on the fly. In this paper the method of coordinate relaxation is applied to one class of such problems. A parallel algorithm based on graph coloring is proposed. Experimental results on a Cray Origin 2000 computer show that the algorithm converges fast ant that it also scales well as more processors are applied. Comparisons show that the convergence of the presented algorithm is much faster on the given test problems than using ARPACK [10]. Key words. sparse matrix algorithms, eigenvalue computation, parallel computing, graph coloring, Cray Origin 2000 AMS subject classifications. 05C50, 05C85, 15A18, 65F15, 65F50, 65Y05, 65Y20 1. Introduction. Frequently problems in quantum mechanics lead to the computation of a small number of extremal eigenval...
