jburkardt

SANDIA_SGMGG\ Sparse Grid Mixed Growth, Generalized Construction {#sandia_sgmgg-sparse-grid-mixed-growth-generalized-construction align=”center”} ==================================================

---

SANDIA_SGMGG is a C++ library which contains some experimental code for the investigation of sparse grids constructed in a generalized fashion, in which the set of indices corresponding to a sparse grid is chosen in a generalized way, rather than being defined by a linear constraint.

Licensing: {#licensing align=”center”}

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

Languages: {#languages align=”center”}

SANDIA_SGMGG is available in a C++ version and a FORTRAN90 version and a MATLAB version.

Related Data and Programs: {#related-data-and-programs align=”center”}

SANDIA_RULES, a C++ library which produces 1D quadrature rules of Chebyshev, Clenshaw Curtis, Fejer 2, Gegenbauer, generalized Hermite, generalized Laguerre, Hermite, Jacobi, Laguerre, Legendre and Patterson types.

SGMGA, a C++ library which creates sparse grids based on a mixture of 1D quadrature rules, allowing anisotropic weights for each dimension.

Reference: {#reference align=”center”}

1. Thomas Gerstner, Michael Griebel,\ Dimension-adaptive tensor-product quadrature,\ Computing,\ Volume 71, Number 1, August 2003, pages 65-87.

Source Code: {#source-code align=”center”}

• sandia_sgmgg.cpp, the source code.
• sandia_sgmgg.hpp, the include file.

Examples and Tests: {#examples-and-tests align=”center”}

• sandia_sgmgg_prb.cpp, a sample calling program.
• sandia_sgmgg_prb_output.txt, the output file.

List of Routines: {#list-of-routines align=”center”}

• SANDIA_SGMGG_COEF_INC2 computes tentative coefficient changes.
• SANDIA_SGMGG_COEF_NAIVE returns the combinatorial coefficients.
• SANDIA_SGMGG_NEIGHBOR_NAIVE returns the immediate forward neighbor array.

You can go up one level to the C++ source codes.

---

Last revised on 14 January 2011.