Parallel algorithms for singular value decomposition

In motion rate control applications, it is faster and easier to solve the equations involved if the singular value decomposition (SVD) of the Jacobian matrix is first determined. A parallel SVD algorithm with minimum execution time is desired. One approach using Givens rotations lends itself to parallelization, reduces the iterative nature of the algorithm, and efficiently handles rectangular matrices. This research focuses on the minimization of the SVD execution time when using this approach. Specific issues addressed include considerations of data mapping, effects of the number of processors used on execution time, impacts of the interconnection network on performance, and trade-offs between modes of parallelism. Results are verified by experimental data collected on the PASM parallel machine prototype.<<ETX>>

[1]  Gene H. Golub,et al.  Matrix computations , 1983 .

[2]  Ling Chen,et al.  Efficient computation of the singular value decomposition on cube connected SIMD machine , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[3]  R. Brent,et al.  Computation of the Singular Value Decomposition Using Mesh-Connected Processors , 1983 .

[4]  Franklin T. Luk,et al.  Computing the Singular-Value Decomposition on the ILLIAC IV , 1980, TOMS.

[5]  Charles A. Klein,et al.  Review of pseudoinverse control for use with kinematically redundant manipulators , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[7]  F. Luk.  Triangular processor array for computing singular values , 1986 .

[8]  Franklin T. Luk,et al.  A new systolic array for the singular value decomposition , 1986 .

[9]  J. Nash.  Compact Numerical Methods for Computers , 2018 .

[10]  Anthony A. Maciejewski,et al.  The Singular Value Decomposition: Computation and Applications to Robotics , 1989, Int. J. Robotics Res..

[11]  Howard Jay Siegel,et al.  Predicting Performance and Selecting Modes of Parallelism: A Case Study Using Cyclic Reduction on Three Parallel Machines , 1993, J. Parallel Distributed Comput..

[12]  Howard Jay Siegel,et al.  Mapping computer-vision-related tasks onto reconfigurable parallel-processing systems , 1992, Computer.

[13]  Daniel E. Whitney,et al.  Resolved Motion Rate Control of Manipulators and Human Prostheses , 1969 .

[14]  Henry G. Dietz,et al.  Static synchronization beyond VLIW , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[15]  Howard Jay Siegel,et al.  Software Issues for the PASM Parallel Processing System , 1993 .

[16]  Tsuneo Yoshikawa,et al.  Manipulability of Robotic Mechanisms , 1985 .

[17]  Kenneth E. Batcher.  The Multidimensional Access Memory in STARAN , 1977, IEEE Transactions on Computers.