How good can polynomial interpolation on the sphere be?

This paper explores the quality of polynomial interpolation approximations over the sphere Sr−1⊂Rr in the uniform norm, principally for r=3. Reimer [17] has shown there exist fundamental systems for which the norm ‖Λn‖ of the interpolation operator Λn, considered as a map from C(Sr−1) to C(Sr−1), is bounded by dn, where dn is the dimension of the space of all spherical polynomials of degree at most n. Another bound is dn1/2(λavg/λmin )1/2, where λavg and λmin  are the average and minimum eigenvalues of a matrix G determined by the fundamental system of interpolation points. For r=3 these bounds are (n+1)2 and (n+1)(λavg/λmin )1/2, respectively. In a different direction, recent work by Sloan and Womersley [24] has shown that for r=3 and under a mild regularity assumption, the norm of the hyperinterpolation operator (which needs more point values than interpolation) is bounded by O(n1/2), which is optimal among all linear projections. How much can the gap between interpolation and hyperinterpolation be closed?For interpolation the quality of the polynomial interpolant is critically dependent on the choice of interpolation points. Empirical evidence in this paper suggests that for points obtained by maximizing λmin , the growth in ‖Λn‖ is approximately n+1 for n<30. This choice of points also has the effect of reducing the condition number of the linear system to be solved for the interpolation weights. Choosing the points to minimize the norm directly produces fundamental systems for which the norm grows approximately as 0.7n+1.8 for n<30. On the other hand, ‘minimum energy points’, obtained by minimizing the potential energy of a set of (n+1)2 points on S2, turn out empirically to be very bad as interpolation points.This paper also presents numerical results on uniform errors for approximating a set of test functions, by both interpolation and hyperinterpolation, as well as by non-polynomial interpolation with certain global basis functions.

[1]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[2]  Ivan G. Graham,et al.  A New Spectral Boundary Integral Collocation Method for Three-Dimensional Potential Problems , 1998 .

[3]  Ian H. Sloan,et al.  The Uniform Error of Hyperinterpolation on the Sphere , 1999 .

[4]  Alexander Shapiro,et al.  On Eigenvalue Optimization , 1995, SIAM J. Optim..

[5]  M. Newman,et al.  Interpolation and approximation , 1965 .

[6]  Philip Crotwell.  Constructive Approximation on the Sphere , 2000 .

[7]  Ivan G. Graham,et al.  A pseudospectral three-dimensional boundary integral method applied to a nonlinear model problem from finite elasticity , 1994 .

[8]  Len Bos,et al.  Some remarks on the Feje´r problem for lagrange interpolation in several variables , 1990 .

[9]  Kurt Jetter,et al.  Error estimates for scattered data interpolation on spheres , 1999, Math. Comput..

[10]  Jörg Fliege,et al.  A Two-Stage Approach for Computing Cubature Formulae for the Sphere , 1996 .

[11]  Ian H. Sloan,et al.  Polynomial interpolation and hyperinterpolation over general regions , 1995 .

[12]  P. Swarztrauber,et al.  A standard test set for numerical approximations to the shallow water equations in spherical geometry , 1992 .

[13]  Ian H. Sloan,et al.  The uniform norm of hyperinterpolation on the unit sphere in an arbitrary number of dimensions , 2001 .

[14]  T. H. Gronwall.  On the degree of convergence of Laplace’s series , 1914 .

[15]  Max L. Warshauer,et al.  Lecture Notes in Mathematics , 2001 .

[16]  Robert S. Womersley.  A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere , 2000 .

[17]  Manfred Reimer,et al.  Hyperinterpolation on the Sphere at the Minimal Projection Order , 2000 .

[18]  Manfred Reimer,et al.  The Average Size of Certain Gram-Determinants and Interpolation on Non-Compact Sets , 1997 .

[19]  Jörg Fliege,et al.  The distribution of points on the sphere and corresponding cubature formulae , 1999 .

[20]  Michael L. Overton,et al.  Large-Scale Optimization of Eigenvalues , 1990, SIAM J. Optim..

[21]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[22]  Nicolae Tita,et al.  On a class of linear operators , 1981 .

[23]  Manfred Reimer,et al.  Interpolation on the sphere and bounds for the Lagrangian square sums , 1987 .

[24]  Ian H. Sloan,et al.  Constructive Polynomial Approximation on the Sphere , 2000 .