Lebedev Grid

In numerical analysis, Lebedev quadrature, named after Vyacheslav Ivanovich Lebedev, is an approximation to the surface integral of a function over a three-dimensional sphere. The grid is constructed so to have octahedral rotation and inversion symmetry. The number and location of the grid points together with a corresponding set of integration weights are determined by enforcing the exact integration of polynomials (or equivalently, spherical harmonics) up to a given order, leading to a sequence of increasingly dense grids analogous to the one-dimensional Gauss-Legendre scheme.

The Lebedev grid is often employed in the numerical evaluation of volume integrals in the spherical coordinate system, where it is combined with a one-dimensional integration scheme for the radial coordinate. Applications of the grid are found in fields such as computational chemistry and neutron transport.

Angular integrals

The surface integral of a function over the unit sphere,

:I = \int \mathrm\Omega\ f(\Omega) = \int_0^\pi \sin(\theta)\mathrm\theta\int_0^\mathrm\varphi\ f(\theta,\varphi),

is approximated in the Lebedev scheme as

:\tilde = 4\pi \sum_^\ w_i f(\theta_i,\varphi_i),

where the particular grid points and grid weights are to be determined. The use of a single sum, rather than two one dimensional schemes from discretizing the ''θ'' and ''φ'' integrals individually, leads to more efficient procedure: fewer total grid points are required to obtain similar accuracy. A competing factor is the computational speedup available when using the direct product of two one-dimensional grids. Despite this, the Lebedev grid still outperforms product grids. However, the use of two one-dimensional integration better allows for fine tuning of the grids, and simplifies the use of any symmetry of the integrand to remove symmetry equivalent grid points.

Construction

The Lebedev grid points are constructed so as to lie on the surface of the three-dimensional unit sphere and to be invariant under the octahedral rotation group with inversion. For any point on the sphere, there are either five, seven, eleven, twenty-three, or forty-seven equivalent points with respect to the octahedral group, all of which are included in the grid. Further, all points equivalent under the rotational and inversion group share the same weights. The smallest such set of points is constructed from all six permutations of (±1, 0, 0) (collectively denoted as ''a''¹), leading to an integration scheme

:\tilde_6 = A_1 \sum_^6f(a_i^1),

where the grid weight is ''A''₁. Geometrically these points correspond to the vertices of a regular octahedron when aligned with the Cartesian axes. Two more sets of points, corresponding to the centers and vertices of the octahedron, are all eight uncorrelated permutations of $1/\sqrt(\pm 1,\pm 1,\pm 1)$ (denoted as ''a''³), and all twelve permutations of $1/\sqrt(\pm 1,\pm 1,0)$ (denoted as ''a''²). This selection of grid points gives rise to the scheme

:\tilde_ = A_1 \sum_^6 f(a_i^1) +A_2 \sum_^ f(a_i^2) +A_3\sum_^f(a_i^3),

where ''A''₁, ''A''₂, and ''A''₃ are the weight functions that still need to be determined. Three further types of points can be employed as shown in the table. Each of these types of classes can contribute more than one set of points to the grid. In complete generality, the Lebedev scheme is

:
\begin
\tilde_N = A_1\sum_^6 f(a_i^1)& + A_2\sum_^ f(a_i^2) + A_3 \sum_^ f(a_i^3) \\
& + \sum_^ B_k \sum_^ f(b_i^k) + \sum_^ C_k \sum_^ f(c_i^k) + \sum_^ D_k \sum_^ f(d_i^k),
\end

where the total number of points, ''N'', is

:$N = 26 + 24(N_1 + N_2) + 48N_3.\,$

The determination of the grid weights is achieved by enforcing the scheme to integrate exactly all polynomials up to a given order. On the unit sphere, this is equivalent to integrating all spherical harmonics up to the same order. This problem is simplified by a theorem of Sergei Lvovich Sobolev implying that this condition need be imposed only on those polynomials which are invariant under the octahedral rotation group with inversion. Enforcing these conditions leads to a set of nonlinear equations which have been solved and tabulated up to order 131 in the polynomial.

References

{{reflist

External links

Fortran code
for evaluating Lebedev grid points and weights
*Python codes
quadpy
an
CasperBeentjes
Downloadable grid points
Numerical integration (quadrature)