Related papers: Optimal sampling patterns for Zernike polynomials
Zernike polynomials are widely used in optics and ophthalmology due to their direct connection to classical optical aberrations. While orthogonal on the unit disk, their application to discrete data or non-circular domains--such as…
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…
Integration operational matrix methods based on Zernike polynomials are used to determine approximate solutions of a class of non-homogeneous partial differential equations (PDEs) of first and second order. Due to the nature of the Zernike…
Zernike polynomials are widely used mathematical models of experimentally observed optical aberrations. Their useful mathematical properties, in particular their orthogonality, make them a ubiquitous basis set for solving various problems…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
This paper aims at developing new shape functions adapted to smooth vanishing coefficients for scalar wave equation. It proposes the numerical analysis of their interpolation properties. The interpolation is local but high order convergence…
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
High-dimensional Lagrange interpolation plays a pivotal role in finite element methods, where ensuring the unisolvence and symmetry of its interpolation space and nodes set is crucial. In this paper, we leverage group action and group…
We give a solution to Pick's interpolation problem on the unit polydisc in $\mathbb{C}^n$, $n\geq 2$, by characterizing all interpolation data that admit a $\mathbb{D}$-valued interpolant, in terms of a family of positive-definite kernels…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We obtain sufficient conditions for arrays of points, $\mathcal{Z}=\{\mathcal{Z}(L) \}_{L\ge 1},$ on the unit sphere $\mathcal{Z}(L)\subset \mathbb{S}^d,$ to be Marcinkiewicz-Zygmund and interpolating arrays for spaces of spherical…
A set of orthogonal polynomials on the unit disk $B(0,1)$ known as Zernike polynomials are commonly used in the analysis and evaluation of optical systems. Here Zernike polynomials are used to construct wavelets for polynomial subspaces of…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…