Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) (Q1188308)
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: Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) |
scientific article; zbMATH DE number 40462
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) |
scientific article; zbMATH DE number 40462 |
Statements
Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) (English)
0 references
13 August 1992
0 references
A parallel implementation of Arnoldi's subspace method on the Connection Machine is presented. With a 16K-processor CM2, performances of a few hundred Megaflops for a matrix size of several thousands are obtained when computing small number of eigenvalues and eigenvectors. The extrapolated performance on a 64K-processor CM2 indicates that the asymptotic speed will be greater than 1 Gigaflop for very large matrices. Using the subspace method is proposed as a programming methodology for massively-parallel machines in order to obtain a good performance when solving some large linear algebra problems, especially eigenproblems.
0 references
non-Hermitian eigenproblems
0 references
parallel implementation
0 references
Arnoldi's subspace method
0 references
Connection Machine
0 references
performances
0 references
eigenvalues
0 references
eigenvectors
0 references
very large matrices
0 references
massively-parallel machines
0 references
0 references
