An overview of parallel algorithms for the singular value and symmetric eigenvalue problems (Q1122943): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Michael W. Berry / rank
Normal rank
 
Property / author
 
Property / author: Ahmed H. Sameh / rank
Normal rank
 

Revision as of 14:51, 11 February 2024

scientific article
Language Label Description Also known as
English
An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
scientific article

    Statements

    An overview of parallel algorithms for the singular value and symmetric eigenvalue problems (English)
    0 references
    1989
    0 references
    Two approaches for solving dense symmetric eigensystems on a multiprocessor are presented. One method is based upon Jacobi diagonalization. Two- and one-sided Jacobi schemes are discussed. The latter is motivated by the singular value decomposition (SVD) of rectangular matrices. The second approach couples an efficient reduction to tridiagonal form via Householder transformation with a multisectioning strategy to determine the eigenvalues and eigenvectors of the corresponding tridiagonal matrix. A multiprocessor scheme is presented to determine the SVD of a matrix. Possible hybrid SVD algorithm may be derived. The performance of the algorithms is compared with that of the classical algorithms implemented in EISPACK on the Alliant FX/8 and CRAY X-MP.
    0 references
    parallel algorithms
    0 references
    dense symmetric eigensystems
    0 references
    multiprocessor
    0 references
    Jacobi diagonalization
    0 references
    singular value decomposition
    0 references
    reduction to tridiagonal form
    0 references
    Householder transformation
    0 references
    eigenvalues
    0 references
    eigenvectors
    0 references
    hybrid SVD algorithm
    0 references

    Identifiers