Efficient computation of the singular value decomposition on cube connected SIMD machine

Authors:
H. Y. J. Chuang;L. Chen
Affiliations:
Computer Science Department, University of Pittsburgh, Pittsburgh, PA;Mathematics Department, Yangzhou Teachers College, Yangzhou, China
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 1
Cited 3

A Triangular Processor Array for Computing the Singular Value Decomposition

A Triangular Processor Array for Computing the Singular Value Decomposition

Computation of singular value decomposition on arrays with pipelined optical buses

SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Parallel Approaches for Singular Value Decomposition as Applied to Robotic Manipulator Jacobians

International Journal of Parallel Programming
Parallel approaches for singular value decomposition as applied to robotic manipulator Jacobians

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The singular value decomposition (SVD) has many real-time applications. Recently, there has been much interest in developing efficient methods to compute SVD in parallel machines. This paper presents an efficient method for computing SVD in a cube connected SIMD (single instruction stream - multiple data stream) parallel computer. The method is based on a one-sided orthogonalization algorithm due to Hestenes. In a cube connected SIMD with n/2 processors, the SVD of an m by n matrix requires a computation time of &Ogr;(mn) per sweep. Although the time complexity (excluding communication time) is the same as that of the best known SVD method on linearly connected SIMD, the communication time is much smaller because the amount of data moved among the nodes is only about one half. The SVD of large matrices on a fixed size system is also discussed.