triangle_fekete_rule, a FORTRAN90 code which can return information defining any of seven Fekete rules for high order interpolation and quadrature over the interior of a triangle in 2D.
Fekete points can be defined for any region OMEGA. To define the Fekete points for a given region, let Poly(N) be some finite dimensional vector space of polynomials, such as all polynomials of degree less than L, or all polynomials whose monomial terms have total degree less than some value L.
Let P(1:M) be any basis for Poly(N). For this basis, the Fekete points are defined as those points Z(1:M) which maximize the determinant of the corresponding Vandermonde matrix:
V = [ P1(Z1) P1(Z2) ... P1(ZM) ] [ P2(Z1) P2(Z2) ... P2(ZM) ] ... [ PM(ZM) P2(ZM) ... PM(ZM) ]
On the triangle, it is known that some Fekete points will lie on the boundary, and that on each side of the triangle, these points will correspond to a set of Gauss-Lobatto points.
The seven rules have the following orders and precisions:
Rule | Order | Precision |
---|---|---|
1 | 10 | 3 |
2 | 28 | 6 |
3 | 55 | 9 |
4 | 91 | 12 |
5 | 91 | 12 |
6 | 136 | 15 |
7 | 190 | 18 |
The computer code and data files described and made available on this web page are distributed under the MIT license
triangle_fekete_rule is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.
CUBE_FELIPPA_RULE, a FORTRAN90 code which returns the points and weights of a Felippa quadrature rule over the interior of a cube in 3D.
LINE_FEKETE, a FORTRAN90 code which approximates the location of Fekete points in an interval [A,B]. A family of sets of Fekete points, indexed by size N, represents an excellent choice for defining a polynomial interpolant.
PYRAMID_FELIPPA_RULE, a FORTRAN90 code which returns Felippa's quadratures rules for approximating integrals over the interior of a pyramid in 3D.
SIMPLEX_GM_RULE, a FORTRAN90 code which defines Grundmann-Moeller quadrature rules over the interior of a simplex in M dimensions.
SQUARE_FELIPPA_RULE, a FORTRAN90 code which returns the points and weights of a Felippa quadrature rule over the interior of a square in 2D.
STROUD, a FORTRAN90 code which contains quadrature rules for a variety of unusual areas, surfaces and volumes in 2D, 3D and M-dimensions.
TETRAHEDRON_FELIPPA_RULE, a FORTRAN90 code which returns Felippa's quadratures rules for approximating integrals over the interior of a tetrahedron in 3D.
TRIANGLE_DUNAVANT_RULE, a FORTRAN90 code which sets up a Dunavant quadrature rule over the interior of a triangle in 2D.
TRIANGLE_EXACTNESS, a FORTRAN90 code which investigates the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
TRIANGLE_FELIPPA_RULE, a FORTRAN90 code which returns Felippa's quadratures rules for approximating integrals over the interior of a triangle in 2D.
TRIANGLE_INTERPOLATE, a FORTRAN90 code which shows how vertex data can be interpolated at any point in the interior of a triangle.
TRIANGLE_LYNESS_RULE, a FORTRAN90 code which returns Lyness-Jespersen quadrature rules over the interior of a triangle in 2D.
TRIANGLE_MONTE_CARLO, a FORTRAN90 code which uses the Monte Carlo method to estimate integrals over the interior of a triangle in 2D.
TRIANGLE_NCC_RULE, a FORTRAN90 code which defines Newton-Cotes Closed (NCC) quadrature rules over the interior of a triangle in 2D.
TRIANGLE_NCO_RULE, a FORTRAN90 code which defines Newton-Cotes Open (NCO) quadrature rules over the interior of a triangle in 2D.
TRIANGLE_SVG, a FORTRAN90 code which uses Scalable Vector Graphics (SVG) to plot a triangle and any number of points, to illustrate quadrature rules and sampling techniques.
TRIANGLE_SYMQ_RULE, a FORTRAN90 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 FORTRAN90 code which sets up a quadrature rule of exactness 5, 10, 15, 20, 25 or 30 over the interior of a triangle in 2D.