Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor (Q911226)
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 4141403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor |
scientific article; zbMATH DE number 4141403 |
Statements
Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor (English)
0 references
1990
0 references
Here parallel versions are developed of the standard algorithms for computing eigenvalues and eigenvectors of an unsymmetric matrix. Various parallelized versions of the central QR algorithm have been tried, but they all show execution times (on an INTEL iPSC/2 hypercube) that are essentially independent of the number of processors used, i.e. there is no marked advantage of parallelism.
0 references
distributed-memory multiprocessor
0 references
timing results
0 references
parallel computation
0 references
eigenvalues
0 references
eigenvectors
0 references
unsymmetric matrix
0 references
QR algorithm
0 references
INTEL iPSC/2 hypercube
0 references
0.845892608165741
0 references
0.8422906994819641
0 references
0.8422906994819641
0 references
0.83998703956604
0 references
