Special pointsets


  • For special pointsets over intervals, triangles (simplex), disk, square, and polygons, see the following url.

Recent codes




Incurvpolygon_cheb: indomain routine on bivariate Jordan domains whose boundary is defined by chebfuns. The files are stored in the compressed folder, that contains:

» incurvpolygon_cheb.m: it is an indomain routine on domains defined whose boundary is defined by chebfuns;

» in the folder there is a demo demo_incurvpolygon_cheb.m, that tests the provided software.

» Source:
» Last update: October 10, 2020.



ChebfunGauss: a Matlab code for cubature on Jordan bivariate domains defined analytically and approximated by Chebfuns. The files are stored in the compressed folder, that contains:

» chebcub_2019.m: it is a more stable version of the previous software and quickly produces a rule with many points, of the choosen degree of precision;

» chebfuncub_compression.m: by this routine one can compress the previous rule to one with the same degree of precision but fewer nodes; first it tries to compute one with internal nodes and positive weights, then one with internal nodes and possible negative weights, then one with possible external nodes and positive weights and finally one with possible external nodes and possible negative weights;

» chebcub_2020.m: it is a version that produces a rule with few points, of the choosen degree of precision (the rule has internal nodes and usually positive weights);

» incurvpolygon_cheb.m: it is an indomain routine on bivariate Jordan domains defined whose boundary is defined by chebfuns;

» in the folder there are several demo,
  • demo_2019.m,
  • demo_2020.m,
  • demo_random_polynomials.m,
  • demo_19vs20.m,
  • demo_incurvpolygon_cheb.m,
that test the provided software.

» Source:
» Last update: October 10, 2020.



In this software, we define a Matlab code for establishing numerically if a point is inside or on the boundary of a spline-curvilinear polygon (the so called "in domain" algorithms). The main routine is incurvpolygon.m. Several demos are available, that show how to use incurvpolygon.m.

» Paper: Tchakaloff-like cubature rules on spline curvilinear polygons with M. Vianello.
» Source: [.zip],
» First Version: April 2019, Last update: September 29, 2020.



Fast Matlab codes for computing algebraic cubature rules on spline-curvilinear polygons. In general the cubature formula may have points outside the domain as well as negative weights.
The main routine is the m. file splinegauss_2020.m that performs cubature over domains with spline curvilinear boundaries. In case one wants to recover rules with less points (possibly with points in the domain and positive weights) one can try to achieve such rule by the routine splinegauss_compression.m.
Several demos are available, that show how to use splinegauss_2020.m and splinegauss_compression.m to produce cubature rules over spline-curvilinear polygons.

» Paper: Gauss-Green cubature and moment computation over arbitrary geometries, with M. Vianello.
» Source: [.zip],
» First Version: March 2009, Last update: September 20, 2020.



Object: this software computes algebraic cubature rules with fixed degree of precision over spline-curvilinear polygons. It includes an in-domain routine incurvpolygon.m that determines if a point is inside one of such regions.
The cubature formula has all points inside the domain as well as positive weights.

» Paper: Tchakaloff-like cubature rules on spline curvilinear polygons with M. Vianello.
» Source: [.zip],
» First Version: May 2020, Last update: May 2020.



Object: this software computes algebraic cubature rules with fixed degree of precision over general polygons (convex or not convex, connected or disconnected, simply or not simply connected). It needs Matlab-built in polyshape environment.

Applications to optics are given.
» Paper: Compressed cubature over polygons with applications to optical design
» Source: [.zip]
» Last update: May 12, 2019.



Object: this software computes cubature rules over the sphere, via Radial Basis Functions and Spherical Radial Basis Functions. We point out that as described in demoRBFweights.m and demoSRBFweights.m , cubature weights are obtained, without the need of the RBF interpolant (though via moments and transpose of Vandermonde matrix).
» Paper: Integration by RBF over the sphere
» Source: [.zip],
» First Version: May 2005, Last update: September 26, 2019.



Object: this software computes cubature rules over disks and annular sectors, via Radial Basis Functions. We point out that as described in demoRBFweights.m, cubature weights are obtained, without the need of the RBF interpolant (though via moments and transpose of Vandermonde matrix).
» Paper: Meshless cubature over the disk by Thin-Plates Splines
» Source: [.zip],
» Old sources: [GreenDisk_v1_0.zip], [GreenDisk_v1_0a.zip]
» First Version: 2008, Last update: September 24, 2019.



Object: this software computes cubature rules over rectangles, via Radial Basis Functions. The first .zip file considers RBF with the same scale for all the centers, the second zip file manages the variable scale case. We point out that as described in demo_2019_weights.m, cubature weights can be obtained, without the need of the RBF interpolant.
» Paper: Numerical cubature on scattered datas by Radial Basis Functions
» Source: [.zip], [.zip]
» First Version: May 2004, Last update: September 23, 2019.



Object: this software computes cubature rules over polygons (convex or not convex), via Radial Basis Functions (Thin Plate Splines)
» Paper: Meshless cubature by Green's formula.
» Source: [.zip]
» First Version: May 2006, Last update: September 11, 2019.



» Source: [ZIP]
» Last update: July 27, 2012.



» Source: [ZIP]
» Last update: July 27, 2012 (Tested August 22, 2016)]



» Object: In this version we determine cubature rules, hyper interpolation and wam on spherical rectangles of the 2-sphere. The novelty is the usage of new cubature rules that are numerically exact but with inferior cardinality. The zip file contains also the new version of the routine trigauss with some tests.
» Source: » Last update: August 25, 2016.



» Object: The MULTIVOP_220816.zip suite allows to compute hyperinterpolants over general regions. Here we show examples on some circular regions or polygons. The more important routine is multivop.m (see the paper http://www.math.unipd.it/~marcov/pdf/multivop.pdf) that allows the numerical computation of orthogonal polynomials over general regions.
» Source: Matlab code for Gauss-like cubature over polygons [MULTIVOP_220816]
» Last update: August 25, 2016.



» Object: The routine trigauss.m computes a quadrature rule over an interval, exact for trigonometric polynomial degree N. Several versions, including the Gauss-Kronrod version (it is not known if they always exist!), are available.
» Source: » Last update: September 13, 2016.



» Object: Software for 1D trigonometric hyperinterpolation and hyperinterpolation over spherical rectangles. HYPERTRIG is based on trigonometric tensorial hyperinterpolation, while HYPERPOL consists in polynomial hyperinterpolation over spherical rectangles (of total degree). For details, see the paper G. Da Fies, A. Sommariva and M. Vianello, Subperiodic trigonometric hyperinterpolation.
» Source: » Last update: October 24, 2016.



» Object: Demo of least squares on a 2D mesh and least squares on a compressed mesh. Examples on union of disks and polygons. For details, see the paper F. Piazzon, A. Sommariva and M. Vianello, Caratheodory-Tchakaloff Subsampling.
» Source: » Last update: November 20, 2016.



» Object: Computation of optimal meshes on sphere, ball and torus. For details, see the paper A. Sommariva and M. Vianello, Discrete norming inequalities on sections of sphere, ball and torus.
» Source: » Last update: April 24, 2017.



» Object: Computation of nested cubature rules on polygons, from bivariate data. For details, see the paper A. Sommariva and M. Vianello, Nearly optimal nested sensors location for polynomial regression on complex geometriess.
» Source: » Last update: May 23, 2017.



Matlab code for cubature over a square [Padua_CC.zip] (using non tensorial Padua and Morrow-Patterson Xu points). The main routine is the m. file main.m that performs cubature over a square using different formulas. All numerical experiments have been tested on Intel Centrino Duo T2400, with Windows XP, Matlab 6.1.0.450 Release 12.1 and GNU Octave 2.1.73. [Last update: October 09, 2007]



Software for Padua points interpolation and cubature. [Padua2DM.tar.gz].



Some routines that can be used to make experiments with WAMs can be found in the following compressed files:
  • [WAM_2D_280210.zip]: a complete version that works on several bivariate domains, not easily adaptable to add own WAMs but right for experiments on general 2D domains.
  • [WAM_2De_010310.zip]: a simple version that does not work on many bivariate domains, but that is easily adaptable to add 2D WAMs.
  • [WAM_3D_010310.zip]: a simple version that does not work on many trivariate domains, but that is easily adaptable to add 3D WAMs.
[Last update: March 01, 2010]




Old versions of our software



ChebfunGauss: a Matlab code for Gauss-Green cubature by the Chebfun package: Matlab code that uses a suitable version of Splinegauss for bivariate domains defined analytically and approximated by Chebfuns. The files are stored in the compressed folder [CHEBFUNGAUSS_2017.zip]. For a demo use the file demo.m, for plotting cubature points plot_pts.m.
» Source:
» Last update: November 26, 2017.




» Object: The polygauss.m routine allows the computation of cubature rules with a certain degree of exactness on a polygon (without self-intersections). The new routine works via quadrangles panelling or triangularization. Some new demos show its usage. We point out that these rules can be compressed, providing a rule with less nodes/weights but the same algebraic degree of exactness (see comprexcub.m).
» Source: » Last update: August 25, 2016.



Matlab code for Gauss-like cubature over polygons [POLYGAUSS_2013_300413.zip]

Previous version: Matlab code for Gauss-like cubature over polygons [GAUSSCUB_2013.zip]. The main routine is the m. file polygauss.m. As demo, please use demo_gausscub.m. A different version, that uses less points but is more time expensive is polygaussj.m. We point out that the routines work in the GNU Octave version 2.1.73 (i686-pc-cygwin) environment. For some numerical experiments in Matlab/Octave see [readme_polygauss.pdf].
  • April 30, 2013: Modification of polygauss.m outputs.
    • For a numerical comparison, see the routine that calls "dblquad" [dblquad_polygons.zip]. [Last update: March 23, 2013]



    Matlab code for Gauss-like cubature over spline curvilinear polygons [SPLINEGAUSS_2009.zip]. The main routine is the m. file splinegauss_2009b that performs cubature over domains with spline curvilinear boundaries.. As demo, please use demo.m for computing cubature over spline curvilinear polygons. In addition, try demo_splinegauss_moments.m for tests on computing moments w.r.t. some specific bases on such domains. All numerical experiments have been done on MAC Book, with MAC OS X, Matlab 7.6.0.324 Release 2008a. [Latest update: November 19, 2009].
    If you are interested in this software, see the more recent routine in SPLINEGAUSS_2020.zip. [Last update: March 27, 2009]



    [POLYGINT_010411.zip] contains several Matlab files for cubature/interpolation over polygons based on AFP (Approximate Fekete Points) and DLP (Discrete Leja Points). The zip file contains also Matlab routines for a minimal triangulation of a polygon and a quadrangulation of a polygon using few quadrangles and triangles. [Last Update: April 01, 2011]



    LEBFEK: Matlab codes and data sets for bivariate Lebesgue and Fekete interpolation.

    In M. Briani, A. Sommariva, M. Vianello, Computing Fekete and Lebesgue points: simplex, square, disk we have described some algorithms for computing (quasi-)Lebesgue and (quasi-)Fekete points on the unit simplex, a square and on the unit disk. The respective codes and sets for these domains can be found in the links below. [Last Update: February 14, 2011]



    Computation of (almost-)minimal rules on the square.

    Matlab codes for computing (almost-)minimal cubature rules on the square.
    1. Asymmetric rule: [ZIP]
    2. Pi symmetric rule: [ZIP]
    3. Pi/2 symmetric rule: [ZIP]
    [Last Update: December 11, 2011]



    Gaussian Rules for Symmetric weight functions.

    Matlab codes for computing Gaussian Rules for Symmetric weight functions.
    1. [ZIP]
    [Last Update: July 27, 2012]



    Matlab codes for computing Fejer and Clenshaw-Curtis rules for general weight functions.
    1. [ZIP]
    [Last Update: July 27, 2012]



    Matlab codes for computing trigonometric quadrature rules.

    Matlab codes for computing trigonometric quadrature rules. A comparison.
    1. [ZIP]
    [Last Update: February 27, 2013]

    Matlab codes for computing good interpolation points or quadrature rules on geographic subregions of the sphere.
      [MATLAB CODES (zip file), interpolation] [MATLAB CODES (zip file), cubature]
    [Last Update: November 20, 2013]