Spherical t-designs provide quadrature rules for the sphere which are exact for polynomials up to degree t. In this paper, we propose 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 and will have computed narrow interval enclosures which are known to contain these nodes with mathematical certainty.
展开▼
