.png){kind=icon}
.png){kind=icon}
Return
Optimal sampling patterns for Zernike polynomials
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2015.11.006.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2015 Elsevier Inc. All rights reserved.
Keywords:
Interpolation
Numerical condition
Zernike polynomials
Lebesgue constants
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W