BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*
DOI10.1080/10637199808947370zbMath0926.65044OpenAlexW2047096655MaRDI QIDQ4238526
Marián Vajteršic, Martin Bečka
Publication date: 28 July 1999
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199808947370
algorithmsparallel computationMIMD computershypercube topologyring topologiesordering schemesIntel Paragonblock two-sided Jacobi methodsingular value decomosition
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient implementation of Jacobi's diagonalization method on the DAP
- A triangular processor array for computing singular values
- A parallel ring ordering algorithm for efficient one-sided Jacobi SVD computations
- Singular value decomposition and least squares solutions
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- On Parallel Jacobi Orderings
- An Improved Algorithm for Computing the Singular Value Decomposition
This page was built for publication: BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*