triangle_ncc_rule


triangle_ncc_rule, an Octave code which defines the weights and abscisass for a sequence of 9 Newton-Cotes closed quadrature rules over the interior of a triangle in 2D.

Newton-Cotes rules have the characteristic that the abscissas are equally spaced. For a triangle, this refers to spacing in the unit reference triangle, or in the barycentric coordinate system. These rules may be mapped to an arbitrary triangle, and will still be valid.

The rules are said to be "closed" when they include points on the boundary of the triangle.

The use of equally spaced abscissas may be important for your application. That may how your data was collected, for instance. On the other hand, the use of equally spaced abscissas carries a few costs. In particular, for a given degree of polynomial accuracy, there will be rules that achieve this accuracy, but use fewer abscissas than Newton-Cotes. Moreover, the Newton-Cotes approach almost always results in negative weights for some abscissas. This is generally an undesirable feature, particularly when higher order quadrature rules are being used.

(Note that the first rule included in the set is not, strictly speaking, a Newton-Cotes closed rule; it's just the rule that uses a single point at the centroid. However, by including this rule as the first in the set, we have a rule with each polynomial degree of exactness from 0 to 8.)

Licensing:

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

Languages:

triangle_ncc_rule is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version.

Related Data and Programs:

triangle_ncc_rule_test

alpert_rule, an Octave code which sets up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.

annulus_rule, an Octave code which computes a quadrature rule for estimating integrals of a function over the interior of a circular annulus in 2d.

cube_felippa_rule, an Octave code which returns the points and weights of a felippa quadrature rule over the interior of a cube in 3d.

pyramid_felippa_rule, an Octave code which returns felippa's quadratures rules for approximating integrals over the interior of a pyramid in 3d.

simplex_gm_rule, an Octave code which defines grundmann-moeller quadrature rules over the interior of a simplex in m dimensions.

square_felippa_rule, an Octave code which returns the points and weights of a felippa quadrature rule over the interior of a square in 2d.

stroud, an Octave code which contains quadrature rules for a variety of unusual areas, surfaces and volumes in 2d, 3d and m-dimensions.

tetrahedron_felippa_rule, an Octave code which returns felippa's quadratures rules for approximating integrals over the interior of a tetrahedron in 3d.

tetrahedron_ncc_rule, an Octave code which defines newton-cotes closed quadrature rules over the interior of a tetrahedron in 3d.

triangle_dunavant_rule, an Octave code which sets up a dunavant quadrature rule over the interior of a triangle in 2d.

triangle_fekete_rule, an Octave code which defines fekete rules for quadrature or interpolation over the interior of a triangle in 2d.

triangle_felippa_rule, an Octave code which returns felippa's quadratures rules for approximating integrals over the interior of a triangle in 2d.

triangle_lyness_rule, an Octave code which returns lyness-jespersen quadrature rules over the interior of a triangle in 2d.

triangle_nco_rule, an Octave code which defines newton-cotes open quadrature rules on a triangle.

triangle_symq_rule, an Octave 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, an Octave code which sets up a quadrature rule of exactness 5, 10, 15, 20, 25 or 30 over the interior of a triangle in 2d.

wedge_felippa_rule, an Octave code which returns quadratures rules for approximating integrals over the interior of the unit wedge in 3d.

Reference:

  1. Gisela Engeln-Muellges, Frank Uhlig,
    Numerical Algorithms with C,
    Springer, 1996,
    ISBN: 3-540-60530-4,
    LC: QA297.E56213.
  2. Peter Silvester,
    Symmetric Quadrature Formulae for Simplexes,
    Mathematics of Computation,
    Volume 24, Number 109, January 1970, pages 95-100.

Source Code:


Last revised on 06 April 2019.