Robust and fast computation for the polynomials of optics
Related Experiment Video
Updated: Jun 11, 2026

The Generation of Higher-order Laguerre-Gauss Optical Beams for High-precision Interferometry
Published on: August 12, 2013
1QED Technologies Inc., Rochester, NY 14627, USA. forbes@qedmrf.com
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.
Related Concept Videos
Real Zeros of Polynomials
Synthetic Disvision of Polynomials
Introduction to Polynomial Functions
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Long Division of Polynomials
Polar Equations of Conics

