Parallel algorithms for singular value decomposition Ulrey, Renard R. ; Maciejewski, Anthony A. ; Siegel, Howard Jay "This research was supported in part by the National Science Foundation under grant CDA-9015696, by Sandia National Laboratories under contract 18-4379B, and by Rome Laboratory under contract F30602-94-C-0022." 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. Colorado State University. Libraries 1994 text ; image application/pdf ECEaam00069.pdf FACFECEN100069ARTI eng c1994 IEEE
Parallel algorithms for singular value decomposition
Ulrey, Renard R. ; Maciejewski, Anthony A. ; Siegel, Howard Jay
"This research was supported in part by the National Science Foundation under grant CDA-9015696, by Sandia National Laboratories under contract 18-4379B, and by Rome Laboratory under contract F30602-94-C-0022."
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.
Colorado State University. Libraries
1994
text ; image
application/pdf
ECEaam00069.pdf
FACFECEN100069ARTI
eng
c1994 IEEE