Optimal sampling patterns for Zernike polynomials
Numerical Analysis
2018-07-16 v1
Abstract
A pattern of interpolation nodes on the disk is studied, for which the interpolation 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 numerically 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.
Cite
@article{arxiv.1511.00449,
title = {Optimal sampling patterns for Zernike polynomials},
author = {D. Ramos-Lopez and M. A. Sanchez-Granero and M. Fernandez-Martinez and A. Martinez-Finkelshtein},
journal= {arXiv preprint arXiv:1511.00449},
year = {2018}
}
Comments
21 pages, 7 figures. Submitted to Appl. Math. Comput