Related Experiment Video
Updated: Dec 27, 2025

Convergent Polishing: A Simple, Rapid, Full Aperture Polishing Process of High Quality Optical Flats & Spheres
Published on: December 1, 2014
Integral-based parallel algorithm for the fast generation of the Zernike polynomials
Abstract:
The integral representation of the Zernike radial functions is well approximated by applying the Riemann sums with a surprisingly rapid convergence. The errors of the Riemann sums are found to averagely be not exceed 3 ×10-14, 3.3×10-14, and 1.8×10-13 for the radial order up to 30, 50, and 100, respectively. Moreover, a parallel algorithm based on the Riemann sums is proposed to directly generate a set of radial functions. With the aid of the graphics processing units (GPUs), the algorithm shows an acceleration ratio up to 200-fold over the traditional CPU computation. The fast generation for a set of Zernike radial polynomials is expected to be valuable in further applications, such as the aberration analysis and the pattern recognition.
Related Concept Videos
Real Zeros of Polynomials
Complex Zeros
Inverse z-Transform by Partial Fraction Expansion
To begin the process, the poles of the function are identified and the function is...
Fundamental Theorem of Algebra
Synthetic Disvision of Polynomials
Parallel-Axis Theorem for an Area
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...

