The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- 1 January 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 6 (1) , 69-84
- https://doi.org/10.1137/0906007
Abstract
Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an m ◊ n matrix (m n) and an eigenvalue decomposition of an n ◊ n symmetric matrix. A linear array of O(n) processors is proposed for the singular-value problem; the associated algorithm requires time O(mnS), where S is the number of sweeps (typically S 10). A square array of O(n2) processors with nearest-neighbour communication is proposed for the eigenvalueKeywords
This publication has 11 references indexed in Scilit:
- Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected ProcessorsSIAM Journal on Scientific and Statistical Computing, 1984
- Systolic Networks for Orthogonal DecompositionsSIAM Journal on Scientific and Statistical Computing, 1983
- Why systolic architectures?Computer, 1982
- Computing the Singular-Value Decomposition on the ILLIAC IVACM Transactions on Mathematical Software, 1980
- Singular value decompositions and digital image processingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- On Jacobi and Jacobi-like algorithms for a parallel computerMathematics of Computation, 1971
- On Cyclic Jacobi MethodsJournal of the Society for Industrial and Applied Mathematics, 1963
- Note on the quadratic convergence of the cyclic Jacobi processNumerische Mathematik, 1962
- The cyclic Jacobi method for computing the principal values of a complex matrixTransactions of the American Mathematical Society, 1960
- Inversion of Matrices by Biorthogonalization and Related ResultsJournal of the Society for Industrial and Applied Mathematics, 1958