Regular Article: Computing Fourier Transforms and Convolutions on the 2-Sphere
Advances in Applied Mathematics
Fast algorithms for discrete polynomial transforms
Mathematics of Computation
Hyperinterpolation on the sphere at the minimal projection order
Journal of Approximation Theory
Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature
Mathematics of Computation
Kolmogorov width of classes of smooth functions on the sphere Sd-1
Journal of Complexity
Polynomial operators and local smoothness classes on the unit interval
Journal of Approximation Theory
Optimal lower bounds for cubature error on the sphere S2
Journal of Complexity
A lower bound for the worst-case cubature error on spheres of arbitrary dimension
Numerische Mathematik
Weighted quadrature formulas and approximation by zonal function networks on the sphere
Journal of Complexity
Cubature over the sphere S2 in Sobolev spaces of arbitrary order
Journal of Approximation Theory
Complexity of numerical integration over spherical caps in a Sobolev space setting
Journal of Complexity
Widths of Besov classes of generalized smoothness on the sphere
Journal of Complexity
Hi-index | 0.00 |
Let q=1 be an integer, S^q denote the unit sphere embedded in the Euclidean space R^q^+^1, and @m"q be its Lebesgue surface measure. We establish upper and lower bounds forsupf@?B"p","@r^@c@!"S"^"qfd@m"q-@?k=1Mw"kf(x"k),x"k@?S^q,w"k@?R,k=1,...,M,where B"p","@r^@c is the unit ball of a suitable Besov space on the sphere. The upper bounds are obtained for choices of x"k and w"k that admit exact quadrature for spherical polynomials of a given degree, and satisfy a certain continuity condition; the lower bounds are obtained for the infimum of the above quantity over all choices of x"k and w"k. Since the upper and lower bounds agree with respect to order, the complexity of quadrature in Besov spaces on the sphere is thereby established.