ZERNIPAX: a fast and accurate Zernike polynomial calculator in Python

DOI10.1016/J.AMC.2025.129534MaRDI QIDQ6922153zbMATH OpenFDO

Authors Yigit Gunsur Elmacioglu, Rory Conlin, Daniel W. Dudt, Dario Panici, Egemen Kolemen

Publication date 2 October 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129534

zbMATH Keywords

astrophysicsCPU/GPU computingJAXopticsPythonspectral simulationsZernike polynomials

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• A comparative analysis of algorithms for fast computation of Zernike moments
• A parallel recurrence method for the fast computation of Zernike moments
• Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode
• Comparing seven spectral methods for interpolation and for solving the Poisson equation in a disk: Zernike polynomials, Logan-Shepp ridge polynomials, Chebyshev-Fourier series, cylindrical Robert functions, Bessel-Fourier expansions, square-to-disk confor
• Fast and numerically stable methods for the computation of Zernike moments
• Numerical stability of fast computation algorithms of Zernike moments
• Physical constraints on the coefficients of Fourier expansions in cylindrical coordinates
• Stable, fast computation of high-order Zernike moments using a recursive method

This page was built for publication: ZERNIPAX: a fast and accurate Zernike polynomial calculator in Python

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922153)