SPARSE_GRID_GL is a C++ library which constructs sparse grids based on 1D Gauss-Legendre rules.
Sparse grids are more naturally constructed from a nested family of quadrature rules. Gauss-Legendre rules are not nested, but have higher accuracy. Thus, there is a tradeoff. If we compare two sparse grids of the same "level", one using Gauss-Legendre rules and the other, say, Clenshaw-Curtis rules, then the Gauss-Legendre sparse grid will have higher accuracy...but also a significantly greater number of points. When measuring efficiency, we really need to balance the cost in quadrature points against the accuracy, and so it is not immediately obvious which choice is best!
To slightly complicate matters, Gauss-Legendre rules are very weakly nested, in that the rules of odd order all include the abscissa value X=0.0. A sparse grid constructed from Gauss-Legendre rules will thus have to keep track of this minor point as well.
Here is a table showing the number of points in a sparse grid based on Gauss-Legendre rules, indexed by the spatial dimension, and by the "level", which is simply an index for the family of sparse grids.
A version of the sparse grid library is available in http://tasmanian.ornl.gov, the TASMANIAN library, available from Oak Ridge National Laboratory.
The code described and made available on this web page is distributed under the GNU LGPL license.
SPARSE_GRID_GL is available in a C++ version and a FORTRAN90 version and a MATLAB version.
CC_DISPLAY, a MATLAB library which can compute and display Clenshaw Curtis grids in two dimensions, as well as sparse grids formed from sums of Clenshaw Curtis grids.
QUADRATURE_RULES, a dataset directory which contains quadrature rules; a number of examples of sparse grid quadrature rules are included.
QUADRULE, a C++ library which defines quadrature rules for various intervals and weight functions.
SGMG, a C++ library which creates a sparse grid dataset based on a mixed set of 1D factor rules, and experiments with the use of a linear growth rate for the quadrature rules.
SGMGA, a C++ library which creates sparse grids based on a mixture of 1D quadrature rules, allowing anisotropic weights for each dimension.
SMOLPACK, a C library which implements Novak and Ritter's method for estimating the integral of a function over a multidimensional hypercube using sparse grids.
SPARSE_GRID_CC, a C++ library which define sparse grids based on 1D Clenshaw Curtis quadrature rules.
SPARSE_GRID_CLOSED, a C++ library which define sparse grids based on closed nested quadrature rules.
SPARSE_GRID_DISPLAY, a MATLAB library which can display a 2D or 3D sparse grid.
SPARSE_GRID_F2, a dataset directory which contains sparse grids based on a Fejer Type 2 rule.
SPARSE_GRID_GL, a dataset directory of sparse grids based on a Gauss Legendre rule.
SPARSE_GRID_GP, a dataset directory of sparse grids based on a Gauss Patterson rule.
SPARSE_GRID_HERMITE, a C++ library which creates sparse grids based on Gauss-Hermite rules.
SPARSE_GRID_LAGUERRE, a C++ library which creates sparse grids based on Gauss-Laguerre rules.
SPARSE_GRID_MIXED, a C++ library which constructs a sparse grid using different rules in each spatial dimension.
SPARSE_GRID_NCC, a dataset directory of sparse grids based on a Newton Cotes closed rule.
SPARSE_GRID_NCO, a dataset directory of sparse grids based on a Newton Cotes open rule.
SPARSE_GRID_OPEN, a C++ library which defines sparse grids based on open nested quadrature rules.
TOMS847, a MATLAB program which uses sparse grids to carry out multilinear hierarchical interpolation. It is commonly known as SPINTERP, and is by Andreas Klimke.
You can go up one level to the C++ source codes.