Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Gauß Cubature for the Surface of the Unit Sphere

David De Wit

TL;DR

This work develops a comprehensive framework for Gauß cubature on fully symmetric regions, with a focused specialization to the unit sphere in 3D ($U_3$). By leveraging FS symmetry, it reduces the moment equations to a structured system and uses integer programming to identify minimal-point, high-degree rules (FSMG/FSGM) that exactly integrate polynomials up to degree $2m+1$. The authors derive and solve the corresponding moment equations, reveal the role of spherical harmonics, and produce explicit $U_3$ rules up to degree 17, alongside product rules and a critical comparison of their efficiency. The results advance high-accuracy, low-cost multidimensional integration on spherical surfaces, with direct relevance to boundary-integral methods for 3D Dirichlet problems and to statistical computations requiring efficient cubature in moderate dimensions.

Abstract

Gauß cubature (multidimensional numerical integration) rules are the natural generalisation of the 1D Gauß rules. They are optimal in the sense that they exactly integrate polynomials of as high a degree as possible for a particular number of points (function evaluations). For smooth integrands, they are accurate, computationally efficient formulae. The construction of the points and weights of a Gauß rule requires the solution of a system of moment equations. In 1D, this system can be converted to a linear system, and a unique solution is obtained, for which the points lie within the region of integration, and the weights are all positive. These properties help ensure numerical stability, and we describe the rules as `good'. In the multidimensional case, the moment equations are nonlinear algebraic equations, and a solution is not guaranteed to even exist, let alone be good. The size and degree of the system grow with the degree of the desired cubature rule. Analytic solution generally becomes impossible as the degree of the polynomial equations to be solved goes beyond 4, and numerical approximations are required. The uncertainty of the existence of solutions, coupled with the size and degree of the system makes the problem daunting for numerical methods. The construction of Gauß rules for (fully symmetric) $n$-dimensional regions is easily specialised to the case of $U_3$, the unit sphere in 3D. Despite the problems described above, for degrees up to 17, good Gauß rules for $U_3$ have been constructed/discovered.

Gauß Cubature for the Surface of the Unit Sphere

TL;DR

This work develops a comprehensive framework for Gauß cubature on fully symmetric regions, with a focused specialization to the unit sphere in 3D (). By leveraging FS symmetry, it reduces the moment equations to a structured system and uses integer programming to identify minimal-point, high-degree rules (FSMG/FSGM) that exactly integrate polynomials up to degree . The authors derive and solve the corresponding moment equations, reveal the role of spherical harmonics, and produce explicit rules up to degree 17, alongside product rules and a critical comparison of their efficiency. The results advance high-accuracy, low-cost multidimensional integration on spherical surfaces, with direct relevance to boundary-integral methods for 3D Dirichlet problems and to statistical computations requiring efficient cubature in moderate dimensions.

Abstract

Gauß cubature (multidimensional numerical integration) rules are the natural generalisation of the 1D Gauß rules. They are optimal in the sense that they exactly integrate polynomials of as high a degree as possible for a particular number of points (function evaluations). For smooth integrands, they are accurate, computationally efficient formulae. The construction of the points and weights of a Gauß rule requires the solution of a system of moment equations. In 1D, this system can be converted to a linear system, and a unique solution is obtained, for which the points lie within the region of integration, and the weights are all positive. These properties help ensure numerical stability, and we describe the rules as `good'. In the multidimensional case, the moment equations are nonlinear algebraic equations, and a solution is not guaranteed to even exist, let alone be good. The size and degree of the system grow with the degree of the desired cubature rule. Analytic solution generally becomes impossible as the degree of the polynomial equations to be solved goes beyond 4, and numerical approximations are required. The uncertainty of the existence of solutions, coupled with the size and degree of the system makes the problem daunting for numerical methods. The construction of Gauß rules for (fully symmetric) -dimensional regions is easily specialised to the case of , the unit sphere in 3D. Despite the problems described above, for degrees up to 17, good Gauß rules for have been constructed/discovered.

Paper Structure

This paper contains 39 sections, 1 theorem, 44 equations, 4 figures, 9 tables.

Table of Contents

  1. Introduction
  2. Multidimensional Gauß Cubature
  3. Application: 3D Interior Dirichlet Problem
  4. Gauß Cubature for Fully Symmetric Regions
  5. Motivation for Cubature
  6. Full Symmetry
  7. Gauß Cubature for Fully Symmetric Regions
  8. Conditions for Gauß Cubature in 3D
  9. Gauß Cubature for $U_3$
  10. Spherical Harmonics
  11. Application of the Gauß Cubature
  12. Solution of the Integer Programming Problem for $U_3$
  13. Moments for $U_3$
  14. Solution of the System of Moment Equations $(*)$
  15. Product Rules for $U_3$
  16. ...and 24 more sections

Key Result

Theorem 1.1

For $\mathbf{x} \in G$, the double layer potential with continuous density$\phi$ is a solution of the interior Dirichlet problem if $\phi$ is the solution of the following integral equation, for $\mathbf{x} \in \partial G$:

Figures (4)

  • Figure 1: The system $(*)$ of moment equations used to determine Gauß cubature rules for regions $\mathcal{R}_3 \subseteq \mathbb{R}^{3}$ (after MantelRabinowitz:77).
  • Figure 2: The constraints for system $(*)$, expressed in terms of the $p_{\nu} ( r )$ (after MantelRabinowitz:77, in which it is called system $\bar{C}$). We apply the convention that $\sum_{i=p}^q a_i = 0$ if $q < p$.
  • Figure 3: Constraints for the integer programming problem, where $\mathcal{R}_n$ is $U_3$ (c.f. Figure \ref{['fig:CC']}). In addition, $K_0 = 0$, and $K_1, K_2, K_4 \leqslant 1$. Again, the convention $\sum_{i=p}^q a_i = 0$ if $q < p$, is followed. Values for the right hand sides are tabulated for some choices of $r$ in Table \ref{['tab:RHSU3']}.
  • Figure 4: Plot of the data in Table \ref{['tab:NumECTypes']}.

Theorems & Definitions (9)

  • Definition 1.1: 3D Interior Dirichlet Problem
  • Theorem 1.1: Solution to the interior Dirichlet problem
  • Definition 2.1: Full Symmetry between Two Points
  • Definition 2.2: Full Symmetry for a Set of Points
  • Definition 2.2: Full Symmetry for a Set of Points
  • Definition 2.3: Full Symmetry for a Function
  • Definition 2.4: Fully Symmetric Integration Rule
  • Definition 2.5: Fully Symmetric Minimal Rule
  • Definition 2.6: Good Rule