A Highly Parallel Algorithm For Computing The Singular Value Decomposition Using Optical Processing Techniques

Barry L. Drake; Richard P. Bocker

doi:10.1117/12.944023

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 +

Proceedings Volume 0495, Real-Time Signal Processing VII; (1984) https://doi.org/10.1117/12.944023
Event: 28th Annual Technical Symposium, 1984, San Diego, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available