Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor (Q911226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: EISPACK / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-8191(90)90147-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144988975 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:45, 19 March 2024

scientific article
Language Label Description Also known as
English
Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
scientific article

    Statements

    Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor (English)
    0 references
    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

    Identifiers