Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Algorithm improvements for optical eigenfunction computers

Not Accessible

Your library or personal account may give you access

Abstract

Prior iterative approaches to optical eigenfunction solution have at least three major problems: slow convergence (sometimes); decreasing accuracy after the first solution; and imperfect parallel renormalization (leading to poor use of system dynamic range and hence poor accuracy). We introduce new approaches and algorithms to solve these problems. The new algorithms lead to a tight error bound on eigenvalues and an automatic handling of degenerate or near degenerate eigenvalues. Applications are discussed.

© 1983 Optical Society of America

Full Article  |  PDF Article
More Like This
Direct and implicit optical matrix–vector algorithms

David Casasent and Anjan Ghosh
Appl. Opt. 22(22) 3572-3578 (1983)

Computation of mode eigenfunctions in graded-index optical fibers by the propagating beam method

M. D. Feit and J. A. Fleck
Appl. Opt. 19(13) 2240-2246 (1980)

Optical systolic array processor using residue arithmetic

James Jackson and David Casasent
Appl. Opt. 22(18) 2817-2821 (1983)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (51)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved