Abstract
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 construct well conditioned spherical designs with $N\geq(t+1)^2$ points by maximizing the determinant of a matrix while satisfying a system of nonlinear constraints. Interval methods are then used to prove the existence of a true spherical t-design very close to the calculated points and to provide a guaranteed interval containing the determinant. The resulting spherical designs have good geometrical properties (separation and mesh norm). We discuss the usefulness of the points for both equal weight numerical integration and polynomial interpolation on the sphere and give an example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.