# Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere

@article{An2010WellCS,
title={Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere},
author={Congpei An and Xiaojun Chen and Ian H. Sloan and Robert S. Womersley},
journal={SIAM J. Numer. Anal.},
year={2010},
volume={48},
pages={2135-2157}
}
• Published 1 December 2010
• Mathematics
• SIAM J. Numer. Anal.
A set $\mathcal{X}_{N}$ of $N$ points on the unit sphere is a spherical $t$-design if the average value of any polynomial of degree at most $t$ over $\mathcal{X}_{N}$ is equal to the average value of the polynomial over the sphere. This paper considers the characterization and computation of spherical $t$-designs on the unit sphere $\mathbb{S}^2\subset\mathbb{R}^3$ when $N\geq(t+1)^2$, the dimension of the space $\mathbb{P}_t$ of spherical polynomials of degree at most $t$. We show how to…
44 Citations

## Figures from this paper

• Mathematics
• 2015
This paper studies numerical integration over the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^{3}$ by using spherical $t$-design, which is an equal positive weights quadrature rule with polynomial
• Mathematics
Math. Comput.
• 2018
The worst-case errors of quadrature rules using spherical $t_\epsilon$-designs in a Sobolev space are studied, and a model of polynomial approximation with the $l_1$-regularization using spherical £t_Â£t- designs is investigated.
• Mathematics
SIAM J. Numer. Anal.
• 2012
This work considers polynomial approximation on the unit sphere by a class of regularized discrete least squares methods with novel choices for the regularization operator and the point sets of the discretization.
• Mathematics
• 2015
A spherical $t$-design is a set of points on the sphere that are nodes of a positive equal weight quadrature rule having algebraic accuracy $t$ for all spherical polynomials with degrees $\le t$.
• Mathematics
• 2018
In this paper we make a comparison between certain probabilistic and deterministic point sets and show that some deterministic constructions (spherical $t$-designs) are better or as good as
We analyze explicit trial functions defined on the unit sphere $${\mathbb {S}}^d$$ in the Euclidean space $${\mathbb {R}}^{d+1}$$, d ≥ 1, that are integrable in the $${\mathbb {L}}_p$$-sense, p ∈ [1,
This talk presents some joint work with An, Frommer, Lang, Sloan and Womersley on spherical designs and polynomial approximation on the sphere [1],[2],[4],[5]. Finding “good” finite sets of points on
Cohn--Conway--Elkies--Kumar [Experiment. Math. (2007)] described that one can construct a family of designs on $S^{2n-1}$ from a design on $\mathbb{CP}^{n-1}$. In this paper, we prove their claim for

## References

SHOWING 1-10 OF 33 REFERENCES

• Computer Science, Mathematics
Numerische Mathematik
• 2011
A computational algorithm based on interval arithmetic which, for given t, upon successful completion will have proved the existence of a t-design with (t + 1)2 nodes on the unit sphere and will have computed narrow interval enclosures which are known to contain these nodes with mathematical certainty.
• Mathematics
• 2004
This paper reviews some recent developments in interpolation, interpolatory cubature, and high-order numerical integration on the sphere $S^2$. In interpolatory (polynomial) cubature the integrand is
• Mathematics
• 2008
If the sequence of well separated spherical designs is such that m and n are related by m = O(n2), then the Coulomb energy of each m-point spherical n-design has an upper bound with the same first term and a second term of the same order as the bounds for the minimum energy of point sets on S2.
• Mathematics
SIAM J. Numer. Anal.
• 2006
It is shown that the construction of spherical designs is equivalent to solution of underdetermined equations and a new verification method for underd determined equations is derived using Brouwer’s fixed point theorem.
• Mathematics
SIAM J. Optim.
• 2011
A globally convergent smoothing method to solve the minimization problem by using the exponential smoothing function is developed and shown that an expression of the Clarke generalized gradient of f is Clarke regular and strongly semismooth.
• Mathematics