Share Email Print

Proceedings Paper

Realization Of Lanczos And Conjugate Gradient Algorithms On Optical Linear Algebra Processors
Author(s): Anjan Ghosh
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

The Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors has been described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. It is shown that optical pre conditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is discussed.

Paper Details

Date Published: 25 November 1987
PDF: 8 pages
Proc. SPIE 0827, Real-Time Signal Processing X, (25 November 1987); doi: 10.1117/12.942066
Show Author Affiliations
Anjan Ghosh, University of Iowa (United States)

Published in SPIE Proceedings Vol. 0827:
Real-Time Signal Processing X
J. P. Letellier, Editor(s)

© SPIE. Terms of Use
Back to Top