A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP (Q1179256)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP |
scientific article; zbMATH DE number 24156 |
Statements
A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP (English)
0 references
26 June 1992
0 references
The author presents a parallel algorithm to calculate only the leftmost \(p\) eigenpairs of finite element matrices with very large dimensions. It is shown that the vectorized algorithm achieves an average speed up 3.34 with respect to the best scalar code. The parallel version improves this average speed up by factors 1.72, 2.24, 2.63 with two, three and four processors, respectively. The result suggests that the proposed method ranks among the most efficient parallel algorithms.
0 references
sparse symmetric matrices
0 references
parallel algorithm
0 references
eigenpairs
0 references
finite element matrices
0 references
0.8461295962333679
0 references
0.8247153759002686
0 references
0.8168570399284363
0 references
