Share Email Print

Proceedings Paper

Performance Of The Faddeeva Algorithm On Optical Processors
Author(s): Anjan K. Ghosh; Suvarna Prakash; Palacharla Paparao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

An optical associative processor realizing the versatile Faddeeva algorithm can be used for several computations such as matrix multiplications, matrix decompositions or inversions, and singular value decompositions just by changing the structure of the data stored. Thus such an optical processor is programmable and efficient. In this paper the realization of this algorithm on various optical structures and their performance are described. For unstable data structures it is necessary to use a preprocessed Faddeeva algorithm on the optical processors for accurate results. The procedure of preprocessing and the performance of the preprocessed Faddeeva algorithm are also described.

Paper Details

Date Published: 17 May 1989
PDF: 8 pages
Proc. SPIE 1058, High Speed Computing II, (17 May 1989); doi: 10.1117/12.951684
Show Author Affiliations
Anjan K. Ghosh, University of Iowa (United States)
Suvarna Prakash, University of Iowa (United States)
Palacharla Paparao, University of Iowa (United States)

Published in SPIE Proceedings Vol. 1058:
High Speed Computing II
Keith Bromley, Editor(s)

© SPIE. Terms of Use
Back to Top