Quasi-Monte Carlo rules for numerical integration over the unit sphere $\mathbb{S}^2$
Johann S. Brauchart, Josef Dick

TL;DR
This paper develops and analyzes a quasi-Monte Carlo method for numerical integration on the unit sphere using lifted $(0,m,2)$-nets, demonstrating near-optimal discrepancy properties and improved bounds over previous methods.
Contribution
It introduces a novel lifting approach for $(0,m,2)$-nets to the sphere and proves their near-optimal discrepancy and uniform distribution properties.
Findings
Construction is nearly optimal for spherical rectangle discrepancy.
Point sets are asymptotically uniformly distributed on $S^2$.
Upper bound on spherical cap $L_2$-discrepancy of order $N^{-1/2} (\log N)^{1/2}$.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
