Translator Disclaimer
18 July 1988 Performance Analysis Of Matrix Preconditioning Algorithms On Parallel Optical Processors.
Author Affiliations +
Abstract
An efficient way of using analog optical associative processors is to implement robust computational algorithms that require high throughput rate but exhibit tolerance for roundoff errors and noise. Matrix preconditioning algorithms used for preprocessing the data of linear algebraic equations have these properties. In this paper, the performance of polynomial matrix preconditioning algorithms on optical processors is analyzed. The results of the error analysis and numerical experiments show that for a given set of data the spatial errors and detector noise below a certain threshold level do not affect the accuracy of optical preconditioning. It is also shown that optical preconditioning improves the rate of convergence and the accuracy of the final solution of a linear algebra problem. Simple and efficient optical preprocessors designed with preconditioning algorithms can thus assist parallel solvers of linear algebraic equations and other engineering problems.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Anjan Ghosh "Performance Analysis Of Matrix Preconditioning Algorithms On Parallel Optical Processors.", Proc. SPIE 0939, Hybrid Image and Signal Processing, (18 July 1988); https://doi.org/10.1117/12.947042
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
Back to Top