QMC designs: optimal order Quasi Monte Carlo Integration schemes on the sphere (1208.3267v1)
Abstract: We study equal weight numerical integration, or Quasi Monte Carlo (QMC) rules, for functions in a Sobolev space $Hs(Sd)$ with smoothness parameter $s>d/2$ defined over the unit sphere $Sd$ in $R{d+1}$. Focusing on $N$-point sets that achieve optimal order QMC error bounds (as is the case for efficient spherical designs), we are led to introduce the concept of QMC designs: these are sequences of $N$-point node sets $X_N$ on $Sd$ such that the worst-case error of the corresponding QMC rules satisfy a bound of order $O(N{-s/d})$ as $N\to\infty$ with an implied constant that depends on the $Hs(Sd)$-norm. We provide methods for generation and numerical testing of QMC designs. As a consequence of a recent result of Bondarenko et al. on the existence of spherical designs with appropriate number of points, we show that minimizers of the $N$-point energy for the reproducing kernel for $Hs(Sd)$, $s>d/2$, form a sequence of QMC designs for $Hs(Sd)$. Furthermore, without appealing to the Bondarenko et al. result, we prove that point sets that maximize the sum of suitable powers of the Euclidean distance between pairs of points form a sequence of QMC designs for $Hs(Sd)$ with $s\in(d/2,d/2+1)$. Numerical experiments suggest that many familiar sequences of point sets on the sphere (equal area, spiral, minimal [Coulomb or log.] energy, and Fekete points) are QMC designs for appropriate values of $s$. For comparison purposes we show that sets of random points that are independently and uniformly distributed on the sphere do not constitute QMC designs for any $s>d/2$. If $(X_N)$ is a sequence of QMC designs for $Hs(Sd)$, we prove that it is also a sequence of QMC designs for $\mathbb{H}{s'}(Sd)$ for all $s'\in(d/2,s)$. This leads to the question of determining the supremum of such $s$, for which we provide estimates based on computations for the aforementioned sequences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.