# square_exactness

square_exactness, a C++ code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a rectangle in 2D.

We assume that the integral to be approximated is of a Legendre type, over a rectangular region:

```        I(f) = integral ( c <= y <= d ) integral ( a <= x <= b ) f(x,y) dx dy
```
and that such integrals are to be approximated by:
```        Q(f) = sum ( 1 <= i <= N ) w(i) * f(x(i),y(i))
```

To determine the exactness of a given quadrature rule, we simply compare the exact integral I(f) to the estimated integral Q(f) for a sequence of monomials of increasing total degree D. This sequence begins with:

```        D = 0:              1
D = 1:          x        y
D = 2:      x^2     xy        x^2
D = 3:  x^3    x^2y     xy^2       y^3
```
and the exactness of a quadrature rule is defined as the largest value of D such that I(f) and Q(f) are equal for all monomials up to and including those of total degree D.

Note that if the 2D quadrature rule is formed as a product of two 1D rules, then knowledge of the 1D exactness of the individual factors gives sufficient information to determine the exactness of the product rule, which will simply be the minimum of the exactnesses of the two factor rules.

### Languages:

square_exactness is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.

### Related Data and Programs:

CUBE_EXACTNESS, a C++ code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.

HYPERCUBE_EXACTNESS, a C++ code which measures the monomial exactness of an M-dimensional quadrature rule over the interior of the unit hypercube in M dimensions.

PYRAMID_EXACTNESS, a C++ code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.

SPHERE_EXACTNESS, a C++ code which tests the monomial exactness of a quadrature rule 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.

SQUARE_GRID, a C++ code which computes a grid of points over the interior of a square in 2D.

SQUARE_HEX_GRID, a C++ code which computes a hexagonal grid of points over the interior of a square in 2D.

TETRAHEDRON_EXACTNESS, a C++ code which investigates the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.

TRIANGLE_EXACTNESS, a C++ code which investigates the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.

WEDGE_EXACTNESS, a C++ code which investigates the monomial exactness of a quadrature rule 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.

### Source Code:

Last revised on 18 April 2020.