Optimal sampling patterns for Zernike polynomials

Abstract

A pattern of interpolation nodes on the disk is studied, for which the inter- polation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike polynomials is used. It is shown that these nodes have an excellent performance also from several alternative points of view, providing a numer- ically stable surface reconstruction, starting from both the elevation and the slope data. Sampling at these nodes allows for a more precise recovery of the coefficients in the Zernike expansion of a wavefront or of an optical surface. Keywords: Interpolation Numerical condition Zernike polynomials Lebesgue constant