Show simple item record

dc.contributor.authorRamos López, Darío
dc.date.accessioned2018-02-09T08:44:33Z
dc.date.available2018-02-09T08:44:33Z
dc.date.issued2016
dc.identifier.issn0096-3003
dc.identifier.urihttp://hdl.handle.net/10835/5616
dc.description.abstractA 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 constantses_ES
dc.language.isoenes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleOptimal sampling patterns for Zernike polynomialses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.identifier.doihttp://dx.doi.org/10.1016/j.amc.2015.11.006


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internacional