Paper
4 September 2002 Efficient computation with special functions like the circle polynomials of Zernike
Philip R. Riera, Geoffrey S. Pankretz, Daniel M. Topa
Author Affiliations +
Abstract
The circle polynomials of Zernike play a prominent role in optical analysis. While decompositions of wavefronts into Zernike polynomial series can yield valuable insight, computing with the polynomials themselves is quite inefficient. Here we outline how rational polynomials like those of Zernike, Legendre, Chebyshev and Laguerre can be handled as affine combinations of a Taylor monomial set. We demonstrate how calculations can be performed much more rapidly in the Taylor basis and how to use integer transformations to recover the exact amplitudes in the desired basis. We also explore C++ optimizations for storing the Zernike amplitudes and transforming between Zernike polynomials and Taylor monomials.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Philip R. Riera, Geoffrey S. Pankretz, and Daniel M. Topa "Efficient computation with special functions like the circle polynomials of Zernike", Proc. SPIE 4769, Optical Design and Analysis Software II, (4 September 2002); https://doi.org/10.1117/12.481181
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Zernike polynomials

Wavefronts

C++

Matrices

Matrix multiplication

Mathematics

Computer programming

RELATED CONTENT


Back to Top