28 November 1984 A Highly Parallel Algorithm For Computing The Singular Value Decomposition Using Optical Processing Techniques
Author Affiliations +
Abstract
Described in this paper is a highly-parallel algorithm (referred to as the Permutation Algorithm) for computing the singular value decomposition (SVD) of a matrix. This algorithm is an extension of an earlier algorithm developed by Brent and Luk. The Permutation Algorithm is unique in that it relies heavily on the repeated use of the more fundamental matrix-matrix multiply operation. Therefore, high-speed numerical optical processors currently being developed for performing the matrix-matrix multiply operation appear well suited for implementing the Permutation Algorithm as well.
© (1984) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Barry L. Drake, Barry L. Drake, Richard P. Bocker, Richard P. Bocker, } "A Highly Parallel Algorithm For Computing The Singular Value Decomposition Using Optical Processing Techniques", Proc. SPIE 0495, Real-Time Signal Processing VII, (28 November 1984); doi: 10.1117/12.944023; https://doi.org/10.1117/12.944023
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

The seven wonders of computer arithmetic
Proceedings of SPIE (October 25 2004)
Numerical Linear Algebra On The CEDAR Multiprocessor
Proceedings of SPIE (January 20 1988)
Stability of Bareiss algorithm
Proceedings of SPIE (November 30 1991)
Highly Precise Optical-Hybrid Matrix Processor
Proceedings of SPIE (September 23 1986)

Back to Top