Robust and fast computation for the polynomials of optics

G. W. Forbes

Research output: Contribution to journalArticlepeer-review

40 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)13851-13862
Number of pages12
JournalOptics Express
Volume18
Issue number13
DOIs
Publication statusPublished - 21 Jun 2010
Externally publishedYes

Fingerprint

Dive into the research topics of 'Robust and fast computation for the polynomials of optics'. Together they form a unique fingerprint.

Cite this