z-logo
open-access-imgOpen Access
Robust and fast computation for the polynomials of optics
Author(s) -
G. W. Forbes
Publication year - 2010
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.18.013851
Subject(s) - optics , computation , physical optics , geometrical optics , physics , simple (philosophy) , computer science , algorithm , philosophy , epistemology
Mathematical methods that are poorly known in the field of optics are adapted and shown to have striking significance. Orthogonal polynomials are common tools in physics and optics, but problems are encountered when they are used to higher orders. Applications to arbitrarily high orders are shown to be enabled by remarkably simple and robust algorithms that are derived from well known recurrence relations. Such methods are demonstrated for a couple of familiar optical applications where, just as in other areas, there is a clear trend to higher orders.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here