Add to ORKGThe problem of interpolation at (n + 1) points on the unit sphere S by spherical polynomials of degree at most n is studied. Many sets of points that admit unique interpolation are given explicitly. The proof is based on a method of factorization of polynomials. A related problem of interpolation by trigonometric polynomials is also solved
We consider interpolation by spherical harmonics at points on a (d-1)-dimensional sphere and show th...
AbstractThe purpose of the paper is to adapt to the spherical case the basic theory and the computat...
AbstractAn efficient and flexible algorithm for the spherical interpolation of large scattered data ...
The problem of interpolation at $(n+1)^2$ points on the unit sphere $mathbbS^2$ by spherical polynom...
The problem of interpolation on the unit sphere S by spherical polynomials of degree at most n i...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
Abstract In polynomial interpolation, the choice of the polynomial basis and the location of the int...
We study a subspace of bivariate trigonometric polynomials for interpolating functions on the sphere...
AbstractWe consider interpolation by spherical harmonics at points on a (d−1)-dimensional sphere and...
AbstractPolynomial interpolation of two variables based on points that are located on multiple circl...
We consider interpolation by spherical harmonics at points on a (d-1)-dimensional sphere and show th...
We consider interpolation by spherical harmonics at points on a (d-1)-dimensional sphere and show th...
AbstractThe purpose of the paper is to adapt to the spherical case the basic theory and the computat...
AbstractAn efficient and flexible algorithm for the spherical interpolation of large scattered data ...
The problem of interpolation at $(n+1)^2$ points on the unit sphere $mathbbS^2$ by spherical polynom...
The problem of interpolation on the unit sphere S by spherical polynomials of degree at most n i...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
We compute Chebyshev-like norming grids for polynomials on spherical triangles. The construction is ...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
AbstractThis paper studies a generalization of polynomial interpolation: given a continuous function...
Abstract In polynomial interpolation, the choice of the polynomial basis and the location of the int...
We study a subspace of bivariate trigonometric polynomials for interpolating functions on the sphere...
AbstractWe consider interpolation by spherical harmonics at points on a (d−1)-dimensional sphere and...
AbstractPolynomial interpolation of two variables based on points that are located on multiple circl...
We consider interpolation by spherical harmonics at points on a (d-1)-dimensional sphere and show th...
We consider interpolation by spherical harmonics at points on a (d-1)-dimensional sphere and show th...
AbstractThe purpose of the paper is to adapt to the spherical case the basic theory and the computat...
AbstractAn efficient and flexible algorithm for the spherical interpolation of large scattered data ...