triangle_exactness, a Python code which investigates the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
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 triangle, the degree of a monomial term is the sum of the exponents of x and y. Thus, for instance, the DEGREE of
x2y5is 2+5=7.
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:
triangle_exactness ( 'prefix', degree_max )where
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 MIT license
triangle_exactness is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
cube_exactness, a Python code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3d.
hypercube_exactness, a Python 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 Python code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3d.
simplex_gm_rule, a Python code which defines Grundmann-Moeller quadrature rules over the interior of a triangle in 2d, a tetrahedron in 3d, or over the interior of the simplex in m dimensions.
sphere_exactness, a Python code which tests the polynomial exactness of a quadrature rule over the surface of the unit sphere in 3d;
square_exactness, a Python code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a square (rectangle/quadrilateral) in 2d.
tetrahedron_exactness, a Python code which investigates the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3d.
triangle_dunavant_rule, a Python code which returns a Dunavant quadrature rule over the interior of a triangle in 2d.
triangle_fekete_rule, a Python code which defines a Fekete rule for quadrature or interpolation over the interior of a triangle in 2d.
triangle_felippa_rule, a Python code which returns a Felippa quadrature rule for approximating integrals over the interior of a triangle in 2d.
triangle_lyness_rule, a Python code which returns a Lyness-Jespersen quadrature rules over the interior of a triangle in 2d.
triangle_monte_carlo, a Python code which uses the Monte Carlo method to estimate integrals over the interior of a triangle in 2d.
triangle_symq_rule, a Python code which returns efficient symmetric quadrature rules, with exactness up to total degree 50, over the interior of an arbitrary triangle in 2d, by Hong Xiao and Zydrunas Gimbutas.
triangle_wandzura_rule, a Python code which returns a Wandzura quadrature rule of exactness 5, 10, 15, 20, 25 or 30 over the interior of a triangle in 2d.
wedge_exactness, a Python code which investigates the monomial exactness of a quadrature rule over the interior of the unit wedge in 3d.
STRANG5 is Strang's fifth rule for triangles.