# disk_rule

disk_rule, a C code which computes quadrature rules for approximating integrals over the interior of the general disk in 2D.

The user specifies values NT and NR, where NT is the number of equally spaced angles, and NR controls the number of radial points, the center of the disk (XC,YC), and the radius of the disk RC. The program returns vectors W(NR*NT), X(NR*NT) and Y(NR*NT), which define the rule Q(f).

To use a rule that is equally powerful in R and T, typically, set NT = 2 * NR.

Given NT, NR, and the quadrature vectors W, X, Y, the integral I(f) is estimated by Q(f) as follows:

```        s = w' * f(x,y);
area = pi * rc ^ 2;
q = area * s;
```

### Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

### Languages:

disk_rule is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

### Related Data and Programs:

ANNULUS_RULE, a C code which computes a quadrature rule for estimating integrals of a function over the interior of a circular annulus in 2D.

CIRCLE_RULE, a C code which computes quadrature rules over the circumference of the unit circle in 2D.

CUBE_FELIPPA_RULE, a C code which returns the points and weights of a Felippa quadrature rule over the interior of a cube in 3D.

DISK01_INTEGRALS, a C code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.

DISK01_MONTE_CARLO, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit disk in 2D;

DISK01_RULE, a C code which computes quadrature rules over the interior of the unit disk in 2D.

PYRAMID_FELIPPA_RULE, a C code which returns Felippa's quadratures rules for approximating integrals over the interior of a pyramid in 3D.

SPHERE_LEBEDEV_RULE, a C code which computes Lebedev quadrature rules on the surface of the unit sphere in 3D.

SQUARE_FELIPPA_RULE, a C code which returns the points and weights of a Felippa quadrature rule over the interior of a square in 2D.

STROUD, a C code which defines quadrature rules for a variety of M-dimensional regions, including the interior of the square, cube and hypercube, the pyramid, cone and ellipse, the hexagon, the M-dimensional octahedron, the circle, sphere and hypersphere, the triangle, tetrahedron and simplex, and the surface of the circle, sphere and hypersphere.

TETRAHEDRON_FELIPPA_RULE, a C code which returns Felippa's quadratures rules for approximating integrals over the interior of a tetrahedron in 3D.

TRIANGLE_FEKETE_RULE, a C code which defines Fekete rules for interpolation or quadrature over the interior of a triangle in 2D.

TRIANGLE_FELIPPA_RULE, a C code which returns Felippa's quadratures rules for approximating integrals over the interior of a triangle in 2D.

WEDGE_FELIPPA_RULE, a C code which returns quadratures rules for approximating integrals over the interior of the unit wedge in 3D.

### Reference:

1. Philip Davis, Philip Rabinowitz,
Methods of Numerical Integration,
Second Edition,
Dover, 2007,
ISBN: 0486453391,
LC: QA299.3.D28.
2. Sylvan Elhay, Jaroslav Kautsky,
Algorithm 655: IQPACK, FORTRAN Subroutines for the Weights of Interpolatory Quadrature,
ACM Transactions on Mathematical Software,
Volume 13, Number 4, December 1987, pages 399-415.

### Source Code:

Last revised on 18 June 2019.