Fast and robust computation of Cartesian derivatives of Zernike polynomials

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F14%3A00217751" target="_blank" >RIV/68407700:21110/14:00217751 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.optlaseng.2013.07.012" target="_blank" >http://dx.doi.org/10.1016/j.optlaseng.2013.07.012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.optlaseng.2013.07.012" target="_blank" >10.1016/j.optlaseng.2013.07.012</a>

Result language
angličtina
Original language name
Fast and robust computation of Cartesian derivatives of Zernike polynomials
Original language description
This work deals with a problem of an effective and robust evaluation of Cartesian partial derivatives of Zernike polynomials. Calculations based on explicit relations suffer from high computational costs and are numerically instable for higher orders. Thus, fast and numerically stable methods for calculation of derivatives of Zernike polynomials are needed. Such methods employing recursive techniques based on the relation of Zernike radial polynomials to Jacobi polynomials are proposed. The performanceof proposed algorithms is compared to the standard calculation using explicit relations.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BH - Optics, masers and lasers
OECD FORD branch
—

Project
<a href="/en/project/GA13-31765S" target="_blank" >GA13-31765S: Active membrane fluidic optical elements</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)