square_minimal_rule


square_minimal_rule, a C code which returns "almost minimal" quadrature rules, with exactness up to total degree 55, over the interior of the symmetric unit square in 2D, by Mattia Festa and Alvise Sommariva.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

square_minimal_rule is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and a Python version.

Related Data and Programs:

square_minimal_rule_test

c_rule, a C code which computes a quadrature rule which estimates the integral of a function f(x), which might be defined over a one dimensional region (a line) or more complex shapes such as a circle, a triangle, a quadrilateral, a polygon, or a higher dimensional region, and which might include an associated weight function w(x).

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

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

square_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit square in 2D.

square_monte_carlo, a C code which uses the Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.

toms886, a C code which defines the Padua points for interpolation in a 2D region, including the rectangle, triangle, and ellipse, by Marco Caliari, Stefano de Marchi, Marco Vianello. This is a version of ACM TOMS algorithm 886.

Reference:

  1. Mattia Festa, Alvise Sommariva,
    Computing almost minimal formulas on the square,
    Journal of Computational and Applied Mathematics,
    Volume 17, Number 236, November 2012, pages 4296-4302.

Source Code:


Last revised on 10 August 2019.