Optimal sampling patterns for Zernike polynomials

D. Ramos-López, M.A. Sánchez-Granero, M. Fernández-Martínez and Martínez–Finkelshtein, A.

Applied Mathematics and Computation, 2016, vol. 274, issue C, 247-257

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.

Keywords: Interpolation; Numerical condition; Zernike polynomials; Lebesgue constants (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031501468X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:274:y:2016:i:c:p:247-257

DOI: 10.1016/j.amc.2015.11.006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().