pith. sign in

arxiv: 1811.02720 · v1 · pith:FO27U2AMnew · submitted 2018-11-07 · 🧮 math.NA · cs.NA

Zernike Polynomials: Evaluation, Quadrature, and Interpolation

classification 🧮 math.NA cs.NA
keywords polynomialszernikeinterpolationquadraturebasisdirectionhigherjacobi
0
0 comments X
read the original abstract

Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we provide a self-contained reference on Zernike polynomials, algorithms for evaluating them, and what appear to be new numerical schemes for quadrature and interpolation. We also introduce new properties of Zernike polynomials in higher dimensions. The quadrature rule and interpolation scheme use a tensor product of equispaced nodes in the angular direction and roots of certain Jacobi polynomials in the radial direction. An algorithm for finding the roots of these Jacobi polynomials is also described. The performance of the interpolation and quadrature schemes is illustrated through numerical experiments. Discussions of higher dimensional Zernike polynomials are included in appendices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.