title: Robust and fast computation for the polynomials of optics.
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.
authors.affiliation: QED Technologies Inc., Rochester, NY 14627, USA. forbes@qedmrf.com
authors.forename: G W
authors.initials: GW
authors.lastname: Forbes
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical; D055095:Optics and Photonics / Q000379:methods*; D010825:Physics / Q000379:methods*