Performance Of The Faddeeva Algorithm On Optical Processors

Anjan K. Ghosh; Suvarna Prakash; Palacharla Paparao

doi:10.1117/12.951684

17 May 1989 Performance Of The Faddeeva Algorithm On Optical Processors

Anjan K. Ghosh, Suvarna Prakash, Palacharla Paparao

Proceedings Volume 1058, High Speed Computing II; (1989) https://doi.org/10.1117/12.951684
Event: OE/LASE '89, 1989, Los Angeles, CA, United States

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.

Citation Download Citation

Anjan K. Ghosh, Suvarna Prakash, and Palacharla Paparao "Performance Of The Faddeeva Algorithm On Optical Processors", Proc. SPIE 1058, High Speed Computing II, (17 May 1989); https://doi.org/10.1117/12.951684

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