Singular value decomposition on SIMD hypercube and shuffle-exchange computers
The paper presents several implementations of the Hestenes method for the singular value decomposition of real matrices on the hypercube and shuffle-exchange computers of SIMD architecture. Unlike previous methods, the algorithms presented map a column pair onto a column of processors which reduces the time complexity. Another contribution is the proposal of a concept of high-dimensional shuffle-exchange networks. The time complexities achieved for one- and two-dimensional shuffle-exchange computers are of the same order as for their hypercube counterparts while the number of connections is lower/three for one-dimensional shuffle-exchange computers and four for two-dimensional ones/.
- Computing the Singular-Value Decomposition on the ILLIAC IV
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- Inversion of Matrices by Biorthogonalization and Related Results
- Parallel Matrix and Graph Algorithms
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
This page was built for publication: Singular value decomposition on SIMD hypercube and shuffle-exchange computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205900)