TETRAHEDRON_EXACTNESS is a C++ program which investigates the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.
The polynomial exactness of a quadrature rule is defined as the highest total degree D such that the quadrature rule is guaranteed to integrate exactly all polynomials of total degree DEGREE_MAX or less, ignoring roundoff. The total degree of a polynomial is the maximum of the degrees of all its monomial terms. For a tetrahedron, the degree of a monomial term is the sum of the exponents of x, y and z. Thus, for instance, the DEGREE of
x^{2}yz^{5}is 2+1+5=8.
To be thorough, the program starts at DEGREE = 0, and then proceeds to DEGREE = 1, 2, and so on up to a maximum degree DEGREE_MAX specified by the user. At each value of DEGREE, the program generates every possible monomial term, applies the quadrature rule to it, and determines the quadrature error. The program uses a scaling factor on each monomial so that the exact integral should always be 1; therefore, each reported error can be compared on a fixed scale.
The program is very flexible and interactive. The quadrature rule is defined by three files, to be read at input, and the maximum degree is specified by the user as well.
Note that the three files that define the quadrature rule are assumed to have related names, of the form
The exactness results are written to an output file with the corresponding name:
tetrahedron_exactness prefix degree_maxwhere
If the arguments are not supplied on the command line, the program will prompt for them.
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
TETRAHEDRON_EXACTNESS is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.
CUBE_EXACTNESS, a C++ library which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
HYPERCUBE_EXACTNESS, a C++ program 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++ program which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.
SPHERE_EXACTNESS, a C++ program which tests the monomial exactness of a quadrature rule on the surface of the unit sphere in 3D.
SQUARE_EXACTNESS, a C++ library which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a rectangle in 2D.
TETRAHEDRON_ARBQ_RULE, a C++ library which returns quadrature rules, with exactness up to total degree 15, over the interior of a tetrahedron in 3D, by Hong Xiao and Zydrunas Gimbutas.
TETRAHEDRON_FELIPPA_RULE, a C++ library which returns Felippa's quadratures rules for approximating integrals over the interior of a tetrahedron in 3D.
TETRAHEDRON_INTEGRALS, a C++ library which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3D.
TETRAHEDRON_KEAST_RULE, a C++ library which defines ten quadrature rules, with exactness degrees 0 through 8, over the interior of a tetrahedron in 3D.
TETRAHEDRON_MONTE_CARLO, a C++ program which uses the Monte Carlo method to estimate integrals over the interior of a tetrahedron in 3D.
TETRAHEDRON_NCC_RULE, a C++ library which defines Newton-Cotes Closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
TETRAHEDRON_NCO_RULE, a C++ library which defines Newton-Cotes Open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
TRIANGLE_EXACTNESS, a C++ program which investigates the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
WEDGE_EXACTNESS, a C++ program which investigates the monomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
The "W", "X" and "R" files associated with the point sets tested here may be found in the QUADRATURE_RULES_TET directory.
You can go up one level to the C++ source codes.