Covering of spheres by spherical caps and worst-case error for equal weight cubature in Sobolev spaces
arXiv:1407.8311 · doi:10.1016/j.jmaa.2015.05.079
Abstract
We prove that the covering radius of an -point subset of the unit sphere is bounded above by a power of the worst-case error for equal weight cubature for functions in the Sobolev space , where denotes normalized area measure on These bounds are close to optimal when is close to . Our study of the worst-case error along with results of Brandolini et al. motivate the definition of Quasi-Monte Carlo (QMC) design sequences for , which have previously been introduced only in the Hilbert space setting . We say that a sequence of -point configurations is a QMC-design sequence for with provided the worst-case equal weight cubature error for has order as , a property that holds, in particular, for a sequence of spherical -designs in which each design has order points. For the case , we deduce that any QMC-design sequence for with has the optimal covering property; i.e., the covering radius of has order as . A significant portion of our effort is devoted to the formulation of the worst-case error in terms of a Bessel kernel, and showing that this kernel satisfies a Bernstein type inequality involving the mesh ratio of . As a consequence we prove that any QMC-design sequence for is also a QMC-design sequence for for all and, furthermore, if is a quasi-uniform QMC-design sequence for , then it is also a QMC-design sequence for for all .
32 pages, with changes of accepted paper, added supporting organization
Cited by in corpus (9)
- Distributing many points on spheres: minimal energy and designs
- Tight framelets and fast framelet filter bank transforms on manifolds
- Decimated Framelet System on Graphs and Fast G-Framelet Transforms
- Optimal asymptotic bounds for designs on manifolds
- Points on manifolds with asymptotically optimal covering radius
- Cubatures on Grassmannians: moments, dimension reduction, and related topics
- FaVeST: Fast Vector Spherical Harmonic Transforms
- Distributed filtered hyperinterpolation for noisy data on the sphere
- Approximation of Functions: Optimal Sampling and Complexity