Abstract
Spherical t-designs are point sets \(X_{M}=\{x_{1},\ldots, x_{M}\} \subset {\mathbb{S}^{2}}\) which provide quadrature rules with equal weights for the sphere which are exact for polynomials up to degree t. In this paper we consider the problem of finding numerical spherical t-designs on the sphere \({\mathbb{S}^{2}}\) for high polynomial degree \({t \in {\mathbb{N}}}\) . That is, we compute numerically local minimizers of a certain quadrature error A t (X M ). The quadrature error A t was also used for a variational characterization of spherical t-designs by Sloan and Womersley (J Approx Theory 159:308–318, 2009). For the minimization problem we regard several nonlinear optimization methods on manifolds, like Newton and conjugate gradient methods. We show that by means of the nonequispaced fast spherical Fourier transforms we perform gradient and Hessian evaluations in \({\mathcal {O}(t^{2}\log t + M \log^{2}(1/\varepsilon))}\) arithmetic operations, where \({\varepsilon >0 }\) is a prescribed accuracy. Using these methods we present numerical spherical t-designs for t ≤ 1,000, even in the case \({M\approx \frac{1}{2} t^{2}}\) .
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bannai E., Bannai E.: A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Combin. 30, 1392–1425 (2009)
Bondarenko, A., Radchenko, D., Viazovska, M.: Optimal asymptotic bounds for spherical designs. arXiv:1009.4407v3 [math.MG] (2011)
Chen X., Frommer A., Lang B.: Computational existence proof for spherical t-designs. Numer. Math. 117, 289–305 (2010)
Conlon, L.: Differentiable manifolds: a first course. Birkhäuser Advanced Texts: Basler Lehrbücher. (Birkhäuser Advanced Texts: Basel Textbooks). Birkhäuser Boston Inc., Boston (1993)
Daniel J.W.: The conjugate gradient method for linear and nonlinear operator equations. SIAM J. Numer. Anal. 4, 10–26 (1967)
Delsarte P., Goethals J.M., Seidel J.J.: Spherical codes and designs. Geom. Dedicata 6, 363–388 (1977)
Edelman A., Arias T.A., Smith S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20, 303–353 (1999)
Freeden W., Gervens T., Schreiner M.: Constructive Approximation on the Sphere. Oxford University Press, Oxford (1998)
Frigo, M., Johnson, S.G.: FFTW, C subroutine library. http://www.fftw.org (2009)
Górski K.M., Hivon E., Banday A.J., Wandelt B.D., Hansen F.K., Reinecke M., Bartelmann M.: HEALPix: a framework for high-resolution discretization and fast analysis of data distributed on the sphere. Astrophys. J. 622, 759–771 (2005)
Gräf, M.: Numerical spherical designs on S 2. http://www.tu-chemnitz.de/~grman/computations/pointsS2.php(2010)
Gräf M., Kunis S., Potts D.: On the computation of nonnegative quadrature weights on the sphere. Appl. Comput. Harmon. Anal. 27, 124–132 (2009)
Hager W.W., Zhang H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35–58 (2006)
Hardin R.H., Sloane N.J.A.: Mclarens improved snub cube and other new spherical designs in three dimensions. Discret. Comput. Geom. 15, 429–441 (1996)
Hardin, R.H., Sloane, N.J.A.: Spherical designs, a library of putatively optimal spherical t-designs. http://www.research.att.com/~njas/sphdesigns(2002)
Keiner, J., Kunis, S., Potts, D.: NFFT 3.0, C subroutine library. http://www.tu-chemnitz.de/~potts/nfft
Keiner J., Kunis S., Potts D.: Efficient reconstruction of functions on the sphere from scattered data. J. Fourier Anal. Appl. 13, 435–458 (2007)
Keiner J., Kunis S., Potts D.: Using NFFT3—a software library for various nonequispaced fast Fourier transforms. ACM Trans. Math. Softw. 36(Article 19), 1–30 (2009)
Keiner J., Potts D.: Fast evaluation of quadrature formulae on the sphere. Math. Comput. 77, 397–419 (2008)
Kunis S., Potts D.: Fast spherical Fourier algorithms. J. Comput. Appl. Math. 161, 75–98 (2003)
McLaren A.D.: Optimal numerical integration on a sphere. Math. Comput. 17, 361–383 (1963)
Müller C.: Spherical Harmonics. Springer, Aachen (1966)
Novak, E., Woźniakowski, H.: Tractability of multivariate problems volume II: standard information for functionals. Eur. Math. Society, EMS Tracts in Mathematics, vol 12 (2010)
Saff E.B., Kuijlaars A.B.J.: Distributing many points on a sphere. Math. Intell. 19, 5–11 (1997)
Sloan I.H., Womersley R.S.: A variational characterisation of spherical designs. J. Approx. Theory 159, 308–318 (2009)
Smith, S.T.: Optimization techniques on Riemannian manifolds. In: Hamiltonian and gradient flows, algorithms and control Fields Inst. Commun., vol. 3, pp. 113–136. American Mathematical Society, Providence (1994)
Swinbank R., Purser R.J.: Fibonacci grids: a novel approach to global modelling. Q. J. Royal Meteorol. Soc. 132, 1769–1793 (2006)
Udrişte C.: Convex Functions and Optimization Methods on Riemannian Manifolds. Mathematics and its Applications, vol. 297. Kluwer Academic Publishers Group, Dordrecht (1994)
Varshalovich D., Moskalev A., Khersonskii V.: Quantum Theory of Angular Momentum. World Scientific Publishing, Singapore (1988)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gräf, M., Potts, D. On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms. Numer. Math. 119, 699–724 (2011). https://doi.org/10.1007/s00211-011-0399-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-011-0399-7