Paper
28 November 1984 A Highly Parallel Algorithm For Computing The Singular Value Decomposition Using Optical Processing Techniques
Barry L. Drake, Richard P. Bocker
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 and 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); https://doi.org/10.1117/12.944023
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Matrices

Signal processing

Detection and tracking algorithms

Optical signal processing

Electroluminescence

Computing systems

RELATED CONTENT

Time-recursive number-of-tracks estimation for MHT
Proceedings of SPIE (July 13 2000)
Numerical Linear Algebra On The CEDAR Multiprocessor
Proceedings of SPIE (January 21 1988)
A Factorized Extended Kalman Filter
Proceedings of SPIE (January 04 1986)
Stability of Bareiss algorithm
Proceedings of SPIE (December 01 1991)
Highly Precise Optical-Hybrid Matrix Processor
Proceedings of SPIE (September 24 1986)

Back to Top