Interpolation on the disk
From MaRDI portal
Publication:2453468
In this paper the authors use bivariate polynomials defined on the unit disk to construct a wavefront from a data sample. They consider the polynomial interpolation problem corresponding to critical sampling and analyse the stability of a solution and the propagation of errors through the introduction of condition numbers and Lebesgue constants. The interpolant is expressed as a linear combination of Zernike polynomials, whose coefficients represent relevant optical features of the wavefront.
Recommendations
Cites work
- Computing Fekete and Lebesgue points: Simplex, square, disk
- scientific article; zbMATH DE number 2201538 (Why is no real title available?)
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- On polynomial interpolation of two variables
- Optimally stable multivariate bases
- Polynomial interpolation and approximation in C^d
- Polynomial interpolation of holomorphic functions in \(\mathbb{C}\) and \(\mathbb{C}^ n\)
- Radial orthogonality and Lebesgue constants on the disk
Cited in
(9)- Thin interpolating sequences in the disk
- On the computation of sets of points with low Lebesgue constant on the unit disk
- Stability properties of disk polynomials
- A Newton formula for generalized Berzolari-Radon sets
- Interpolation with symmetric polynomials
- Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex, and ball
- Optimal sampling patterns for Zernike polynomials
- An interpolation-regression approach for function approximation on the disk and its application to cubature formulas
- Sampling patterns for Zernike-like bases in non-standard geometries
This page was built for publication: Interpolation on the disk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453468)