Quasi-Monte Carlo rules for numerical integration over the unit sphere
arXiv:1101.5450 · doi:10.1007/s00211-011-0444-6
Abstract
We study numerical integration on the unit sphere using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by lifting a -net given in the unit square to the sphere by means of an area preserving map. A similar approach has previously been suggested by Cui and Freeden [SIAM J. Sci. Comput. 18 (1997), no. 2]. We prove three results. The first one is that the construction is (almost) optimal with respect to discrepancies based on spherical rectangles. Further we prove that the point set is asymptotically uniformly distributed on . And finally, we prove an upper bound on the spherical cap -discrepancy of order (where denotes the number of points). This slightly improves upon the bound on the spherical cap -discrepancy of the construction by Lubotzky, Phillips and Sarnak [Comm. Pure Appl. Math. 39 (1986), 149--186]. Numerical results suggest that the -nets lifted to the sphere have spherical cap -discrepancy converging with the optimal order of .
References in corpus (1)
Cited by in corpus (10)
- Distributing many points on spheres: minimal energy and designs
- QMC designs: optimal order Quasi Monte Carlo Integration schemes on the sphere
- Point sets on the sphere with small spherical cap discrepancy
- Sampling Permutations for Shapley Value Estimation
- "Magic" numbers in Smale's 7th problem
- On Low Discrepancy Samplings in Product Spaces of Motion Groups
- Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
- Optimal Discrete Riesz Energy and Discrepancy
- Measure-preserving mappings from the unit cube to some symmetric spaces
- Discrepancy, separation and Riesz energy of finite point sets on compact connected Riemannian manifolds