{
"id": "epn3gsyehf",
"slug": "sparse-grid",
"title": "Sparse grid",
"updated": "2026-10-15",
"topic_path": [
{
"id": "physical",
"label": "Physical world and mathematics",
"api_url": "https://www.edgepedia.org/api/v1/topics/physical"
},
{
"id": "physical.math",
"label": "Mathematics and statistics",
"api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
},
{
"id": "physical.math.analysis",
"label": "Analysis and mathematical models",
"api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis"
},
{
"id": "physical.math.analysis.numerical_analysis_and_computation",
"label": "Numerical analysis and computation",
"api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis.numerical_analysis_and_computation"
},
{
"id": "physical.math.analysis.numerical_analysis_and_computation.interpolation-and-approximation",
"label": "Interpolation and approximation",
"api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.analysis.numerical_analysis_and_computation.interpolation-and-approximation"
}
],
"geo": [
{
"id": "geo.nongeo.t1800.physical.math.analysis",
"label": "Non-geographic · 1800 to 1945: Analysis and mathematical models",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math.analysis",
"path": [
{
"id": "geo.nongeo",
"label": "Non-geographic",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
},
{
"id": "geo.nongeo.t1800",
"label": "Non-geographic · 1800 to 1945",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800"
},
{
"id": "geo.nongeo.t1800.physical",
"label": "Physical world and mathematics",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical"
},
{
"id": "geo.nongeo.t1800.physical.math",
"label": "Mathematics and statistics",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math"
},
{
"id": "geo.nongeo.t1800.physical.math.analysis",
"label": "Analysis and mathematical models",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math.analysis"
}
]
},
{
"id": "geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
"label": "Non-geographic · 1946 to 2000: Numerical analysis and computation",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
"path": [
{
"id": "geo.nongeo",
"label": "Non-geographic",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
},
{
"id": "geo.nongeo.t1946",
"label": "Non-geographic · 1946 to 2000",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
},
{
"id": "geo.nongeo.t1946.physical",
"label": "Physical world and mathematics",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
},
{
"id": "geo.nongeo.t1946.physical.math",
"label": "Mathematics and statistics",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
},
{
"id": "geo.nongeo.t1946.physical.math.analysis",
"label": "Analysis and mathematical models",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis"
},
{
"id": "geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation",
"label": "Numerical analysis and computation",
"api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.analysis.numerical_analysis_and_computation"
}
]
}
],
"excerpt": "A sparse grid is a numerical construction that represents high-dimensional functions on a subset of a full tensor-product grid, using the Smolyak algorithm, enabling quadrature, interpolation, and surrogate modeling in tens of dimensions.",
"snippet": "A sparse grid is a numerical construction that represents high-dimensional functions on a subset of a full tensor-product grid, using the Smolyak algorithm, enabling quadrature, interpolation, and surrogate modeling in tens of dimensions.",
"node": "physical.math.analysis.numerical_analysis_and_computation.interpolation-and-approximation",
"markdown": "# Sparse grid\n\nA sparse grid is a numerical construction that represents a high-dimensional function on a carefully chosen subset of a full tensor-product grid, so that quadrature, interpolation, and surrogate modeling remain feasible in tens of dimensions instead of only a few. It builds the multivariate approximation as a weighted combination of tensor products of one-dimensional rules, a principle known as the Smolyak algorithm, which constructs good d-dimensional approximations from univariate approximations and is often optimal or almost optimal when the univariate approximations are well chosen.[1](https://encyclopediaofmath.org/wiki/Smolyak_algorithm) Sparse grids carry several other names in the literature, including hyperbolic cross points, discrete blending, Boolean interpolation, and splitting extrapolation.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n\nBeyond integration, the same construction serves interpolation, the solution of partial differential and integral equations, eigenvalue problems,[3](https://www.ins.uni-bonn.de/media/public/publication-media/dimadapt.pdf?pk=177) regression, classification, density estimation, and uncertainty quantification.[4](https://andreasschaab.com/wp-content/uploads/2021/12/handbook_sparse_grids_in_econ.pdf)\n\n| Key fact | Value |\n|---|---|\n| Degrees of freedom | \\( O(N (\\log N)^{d-1}) \\) for a sparse grid versus \\( O(N^{d}) \\) for a full tensor grid of level N per direction[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) |\n| Accuracy (bounded mixed derivatives) | O(N^(-2)(log N)^(d-1)) in the L2 and L-infinity norms with piecewise linear bases[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) |\n| Surplus decay | Hierarchical coefficients decay proportional to \\( 2^{-2\\|l\\|_{1}} \\) for functions with bounded second mixed derivatives[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) |\n| Grid growth example | Isotropic Clenshaw-Curtis level-5 grid: 801 points at \\( d = 5 \\), 8801 points at \\( d = 10 \\)[5](https://ir.cwi.nl/pub/31588/31588.pdf) |\n| Holomorphic rate | Dimension-independent convergence rate 2/p - 1 in the number of points for (s,epsilon)-holomorphic integrands[6](https://www.numdam.org/item/M2AN_2020__54_4_1259_0/) |\n| Practical dimension range | Effective for low and medium dimensions (d lesssim 100); very high dimensions (d approx 1000) remain hard for sparse grids, Monte Carlo, quasi-Monte Carlo, and neural methods alike[7](https://www.mdpi.com/2227-7390/11/19/4191) |\n| Main software | SG++,[8](https://sgpp.github.io/SGpp/) Tasmanian,[9](https://pypi.org/project/Tasmanian/) Sparse Grids MATLAB Kit,[10](https://doi.org/10.1145/3630023) SparseGridsKit.jl,[11](https://doi.org/10.21105/joss.08300) nwspgr,[12](https://doi.org/10.1016/j.jeconom.2007.12.004) smolpack[13](https://doi.org/10.1007/s002110200401) |\n\n## How it works\n\nA full tensor-product grid in d dimensions with \\( N \\) points per direction needs \\( N^{d} \\) points; this exponential growth is the curse of dimensionality.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) The Smolyak construction instead forms a weighted combination of tensor products of one-dimensional rules of different resolutions, keeping only products whose level sum is small. The sparse grid of points is the union of tensor products X^(j1) x ... x X^(jd) over multi-indices j with q-d+1 <= \\|j\\| <= q.[1](https://encyclopediaofmath.org/wiki/Smolyak_algorithm) Equivalently, the sparse grid space of level n is the sum of hierarchical increment spaces W_l with \\|l\\|_1 <= n+d-1; its dimension is O(h_n^(-1) \\|log2 h_n\\|^(d-1)) against O(2^(nd)) for the full grid, and the Lp interpolation error is O(h_n^2 n^(d-1)) against O(h_n^2) for the full grid.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n\nFor quadrature, the combination uses difference formulas Delta_k f := (Q_k - Q_(k-1)) f with Q_0 f := 0, giving the level-n rule Q-hat_n f := sum over \\|l\\|_1 <= n+d-1 of (Delta_(l1) tensor ... tensor Delta_(ld)) f.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) The same principle gives the Smolyak interpolation rule \\( A(L,M) \\), a weighted sum of tensor products of one-dimensional interpolants with coefficients \\( (-1)^{L-\\|i\\|} C(m-1, L-\\|i\\|) \\).[14](https://people.sc.fsu.edu/~jburkardt/latex_src/sparse_interpolant_2013_fsu/sparse_interpolant_2013_fsu.pdf)\n\nError bounds depend on smoothness. For the tensor product norm, the Smolyak error satisfies e(A(q,d), f) <= C_d n^(-k) (log n)^((d-1)(k+1)) \\|f\\|_k, compared with the optimal order n^(-k/d) of tensor product formulas.[1](https://encyclopediaofmath.org/wiki/Smolyak_algorithm) For the energy norm, only \\( O(N) \\) degrees of freedom give accuracy \\( O(N^{-1}) \\), removing the exponential dependence of the logarithmic terms on d from the order.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) For (s,epsilon)-holomorphic parametric integrands with Taylor coefficient summability p in (0,1), Smolyak quadrature achieves the dimension-independent rate 2/p - 1 in the number of points, essentially also in total cost for nested and non-nested one-dimensional rules.[6](https://www.numdam.org/item/M2AN_2020__54_4_1259_0/)\n\n## How it is done\n\nThe practical workflow is: choose a one-dimensional rule family, form the difference formulas, select an index set, and evaluate the model at the resulting sparse grid points.\n\n**Hierarchical surpluses.** In the piecewise linear hierarchical basis, the coefficient alpha_(k,i), the hierarchical surplus, simply corrects the interpolant of level k-1 at a grid point, and the nested structure of the hierarchical grid makes it easy to compute.[4](https://andreasschaab.com/wp-content/uploads/2021/12/handbook_sparse_grids_in_econ.pdf) For functions with bounded second mixed derivatives, surpluses decay proportional to \\( 2^{-2\\|l\\|_{1}} \\); omitting coefficients below a tolerance yields a sparse grid.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n\n**Dimension-adaptive refinement.** Dimension-adaptive tensor-product quadrature, introduced by T. Gerstner and M. Griebel in 2003, finds important dimensions automatically using generalized sparse grid index sets guided by error estimators.[15](https://doi.org/10.1007/s00607-003-0015-5) An index set I is admissible if for all k in I, k - e_j is in I for 1 <= j <= d whenever k_j > 1.[3](https://www.ins.uni-bonn.de/media/public/publication-media/dimadapt.pdf?pk=177) Admissibility is required because the one-dimensional difference formula Delta^(l) f = I^(l) f - I^(l-1) f needs the coarser level interpolant.[5](https://ir.cwi.nl/pub/31588/31588.pdf) Refinement starts from the index set I = {(1,...,1)} and repeatedly adds the admissible forward neighbor with the largest error indicator \\|Delta_k f\\|.[16](https://www.sciencedirect.com/science/article/pii/S0885064X10000452) The resulting interpolant is I(Lambda) f = sum over l in Lambda of Delta^(l1) tensor ... tensor Delta^(ld) f.[5](https://ir.cwi.nl/pub/31588/31588.pdf)\n\n**Spatially adaptive refinement.** Local sparse grids refine in space rather than only in dimension: the most common scheme adds 2^d children in the hierarchical structure when the hierarchical surpluses satisfy g(alpha_(l,i)) >= epsilon for a refinement threshold epsilon >= 0.[4](https://andreasschaab.com/wp-content/uploads/2021/12/handbook_sparse_grids_in_econ.pdf) This line of work is associated with Dirk Pflüger's 2012 treatment of spatially adaptive refinement.[17](https://doi.org/10.1007/978-3-642-31703-3_12) Multivariate quadrature on adaptive sparse grids was also developed by H.-J. Bungartz and S. Dirnstorfer in 2003.[18](https://doi.org/10.1007/s00607-003-0016-4)\n\n## Origin\n\nPublished surveys trace the construction to work on quadrature and interpolation formulas for tensor products of certain classes of functions, which constructs a multidimensional multilevel basis by a special truncation of the tensor product expansion of a one-dimensional multilevel basis.[1](https://encyclopediaofmath.org/wiki/Smolyak_algorithm)\n\nThe classical sparse grid method is a discretization tool, with a CWI report stating sparse grids were introduced to significantly reduce the degrees of freedom describing a discretized PDE solution, with \\( O(h^{-1} (\\log h^{-1})^{d-1}) \\) degrees of freedom and representation error \\( O(h^{2} (\\log h^{-1})^{d-1}) \\).[19](https://www.cwi.nl/documents/199302/MAS-R9823.pdf) The combination technique achieves the same complexity and error, and its component-grid problems are independent and therefore inherently parallelizable.[19](https://www.cwi.nl/documents/199302/MAS-R9823.pdf) Related later formalizations include the weighted tensor product algorithms of G.W. Wasilkowski and H. Woźniakowski (1999)[20](https://doi.org/10.1006/jcom.1999.0512) and high-dimensional polynomial interpolation on sparse grids by Volker Barthelmann, Erich Novak, and Klaus Ritter (2000).[21](https://doi.org/10.1023/a:1018977404843)\n\n## Variants\n\n**One-dimensional rules.** The classic nested Clenshaw-Curtis exponential family has orders 1, 3, 5, 9, 17, 33, ..., and a level-l sparse grid then integrates polynomials of total degree \\( 2l + 1 \\) exactly; Erich Novak and Klaus Ritter showed in 1996 that linear exactness growth 1, 3, 5, 7, 9, ... suffices for this exactness.[22](https://doi.org/10.1007/s002110050231) Nesting greatly simplifies evaluation because new levels reuse old points.[14](https://people.sc.fsu.edu/~jburkardt/latex_src/sparse_interpolant_2013_fsu/sparse_interpolant_2013_fsu.pdf)\n\n**Combination technique.** The sparse grid solution is computed as a combination of anisotropic full grid solutions, u-hat_n(x) = sum over n <= \\|l\\|_1 <= n+d-1 of (-1)^(n+d-\\|l\\|_1-1) (d-1 choose \\|l\\|_1-n) u_l(x).[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n\n**ANOVA connections.** Sparse grids arise from a proper truncation of the tensor-product ANOVA-type expansion, derivable by an optimization problem related to M-term approximation.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) Dimension-wise quadrature based on the anchored-ANOVA decomposition, which needs only point evaluations rather than integrals, includes sparse grid methods as a special case.[16](https://www.sciencedirect.com/science/article/pii/S0885064X10000452)\n\n**Local versus global grids.** The economics literature distinguishes local sparse grids with a hierarchical multilinear basis and global sparse grids with Lagrange polynomials, typically called the Smolyak method, which typically use nested Clenshaw-Curtis grids.[4](https://andreasschaab.com/wp-content/uploads/2021/12/handbook_sparse_grids_in_econ.pdf) Further extensions include higher-order polynomial bases, interpolets, and wavelets.[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n\n## Applications\n\nIn uncertainty quantification, sparse grids serve as stochastic collocation points for PDEs with random inputs; post-processing can convert the collocation expansion into an equivalent polynomial chaos expansion to obtain moments and Sobol sensitivity indices, defined as normalized partial variances, analytically.[5](https://ir.cwi.nl/pub/31588/31588.pdf) In computational finance, sparse grid methods have been employed for valuation of multi-asset options such as basket and outperformance options, path-dependent derivatives, and likelihood estimation;[2](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf) a monograph by Markus Holtz (2010) covers sparse grid quadrature in finance and insurance.[23](https://doi.org/10.1007/978-3-642-16004-2) Sparse grids for regression and classification were introduced by J. Garcke, M. Griebel, and M. Thess in 2001.[24](https://doi.org/10.1007/s006070170007)\n\n## Limitations and alternatives\n\n**Dimension limits.** Standard stochastic collocation and polynomial chaos methods need exponentially many code evaluations in d, limiting them to roughly d <= 5; sparse grids extend this range.[5](https://ir.cwi.nl/pub/31588/31588.pdf) Isotropic grids still bottleneck near \\( d = 10 \\): at level 5 with Clenshaw-Curtis nodes, going from \\( d = 5 \\) (801 points) to \\( d = 10 \\) (8801 points) costs roughly a ten-fold increase.[5](https://ir.cwi.nl/pub/31588/31588.pdf) Overall, sparse grids are effective for d lesssim 100, but d approx 1000 remains a challenge for sparse grids, [Monte Carlo](https://www.edgepedia.org/monte-carlo), quasi-Monte Carlo, and DNN methods alike.[7](https://www.mdpi.com/2227-7390/11/19/4191) The curse also reappears through weights: for weighted Korobov spaces with slowly decaying dimension weights, both the dimension-adaptive algorithm and the weighted tensor product algorithm need a number of points exponential in the dimension for substantial error reduction.[25](https://journal.austms.org.au/ojs/index.php/ANZIAMJ/article/download/3952/1458) A large preasymptotic range can likewise preclude reaching the asymptotic rate \\( 2/p - 1 \\) for practically relevant point counts.[6](https://www.numdam.org/item/M2AN_2020__54_4_1259_0/)\n\n**Comparisons.** Monte Carlo achieves \\( O(N^{-1/2}) \\) error independent of dimension for bounded-variance integrands, while quasi-Monte Carlo achieves \\( O(N^{-1} (\\log N)^{d}) \\) for bounded mixed variation; on physics and finance problems with [Brownian bridge](https://www.edgepedia.org/brownian-bridge) discretization, the dimension-adaptive sparse grid method was clearly superior to both.[3](https://www.ins.uni-bonn.de/media/public/publication-media/dimadapt.pdf?pk=177) For steady groundwater flow with lognormal [hydraulic conductivity](https://www.edgepedia.org/hydraulic-conductivity), no method is uniformly best between quasi-Monte Carlo and sparse grid stochastic collocation; suitability depends on computational cost and error tolerance.[26](https://www.global-sci.com/cicp/article/view/5994) Sparse polynomial chaos expansions, which exploit the sparsity-of-effects principle with sparse regression, were demonstrated by Mathelin and Gallivan (2012) to be less costly and more accurate than PCE based on Smolyak sparse grids.[27](https://ethz.ch/content/dam/ethz/special-interest/baug/ibk/risk-safety-and-uncertainty-dam/publications/reports/RSUQ-2020-002.pdf)\n\n**Software.** SG++ is an open-source toolbox for spatially adaptive sparse grids and the combination technique, covering interpolation, quadrature, PDEs, regression, classification, and uncertainty quantification.[8](https://sgpp.github.io/SGpp/) Tasmanian implements global, sequence, local polynomial, wavelet, and Fourier grid categories and includes a DREAM module for [Bayesian inference](https://www.edgepedia.org/bayesian-inference) that can use sparse grid approximations of the model or likelihood.[9](https://pypi.org/project/Tasmanian/) The Sparse Grids MATLAB Kit was published as ACM Algorithm 1040 by Chiara Piazzola and Lorenzo Tamellini in 2023,[10](https://doi.org/10.1145/3630023) and SparseGridsKit.jl, a 2025 Julia toolbox by Benjamin M. Kent, implements the Gerstner-Griebel dimensional-adaptive algorithm and multi-index stochastic collocation.[11](https://doi.org/10.21105/joss.08300)\n\n## References\n\n1. [Smolyak algorithm - Encyclopedia of Mathematics](https://encyclopediaofmath.org/wiki/Smolyak_algorithm)\n2. [Sparse Grids (Bungartz & Griebel survey; merged copies at math.pku.edu.cn, math.ucdavis.edu, ins.uni-bonn.de sparsegrids.pdf?pk=91)](https://www.ins.uni-bonn.de/media/public/publication-media/sparsegrids_j8NLaMi.pdf?name=sparsegrids.pdf)\n3. [Dimension-Adaptive Tensor-Product Quadrature (Gerstner & Griebel, preprint)](https://www.ins.uni-bonn.de/media/public/publication-media/dimadapt.pdf?pk=177)\n4. [Sparse grids in economics (handbook chapter, Schaab)](https://andreasschaab.com/wp-content/uploads/2021/12/handbook_sparse_grids_in_econ.pdf)\n5. [Adaptive sparse-grid tutorial (CWI, EasyVVUQ/UQ context)](https://ir.cwi.nl/pub/31588/31588.pdf)\n6. [Convergence rates of high dimensional Smolyak quadrature (Zech & Schwab, 2020)](https://www.numdam.org/item/M2AN_2020__54_4_1259_0/)\n7. [An Efficient and Fast Sparse Grid Algorithm for High-Dimensional Numerical Integration (MDI-SG)](https://www.mdpi.com/2227-7390/11/19/4191)\n8. [SG++: General Sparse Grid Toolbox (documentation)](https://sgpp.github.io/SGpp/)\n9. [Tasmanian v8.2 (PyPI release page)](https://pypi.org/project/Tasmanian/)\n10. [Chiara Piazzola, Lorenzo Tamellini (2023). Algorithm 1040: The Sparse Grids Matlab Kit - a Matlab implementation of sparse grids for high-dimensional function approximation and uncertainty quantification. ACM Transactions on Mathematical Software.](https://doi.org/10.1145/3630023)\n11. [Benjamin M. Kent (2025). SparseGridsKit.jl: Adaptive single- and multi-fidelity sparse grid approximation in Julia. The Journal of Open Source Software.](https://doi.org/10.21105/joss.08300)\n12. [Florian Heiss, Viktor Winschel (2008). Likelihood approximation by numerical integration on sparse grids. Journal of Econometrics.](https://doi.org/10.1016/j.jeconom.2007.12.004)\n13. [Knut Petras (2003). Smolyak cubature of given polynomial degree with few nodes for increasing dimension. Numerische Mathematik.](https://doi.org/10.1007/s002110200401)\n14. [Burkardt, 'Sparse Interpolant' (FSU technical note)](https://people.sc.fsu.edu/~jburkardt/latex_src/sparse_interpolant_2013_fsu/sparse_interpolant_2013_fsu.pdf)\n15. [T. Gerstner, M. Griebel (2003). Dimension?Adaptive Tensor?Product Quadrature. Computing.](https://doi.org/10.1007/s00607-003-0015-5)\n16. [Dimension-wise integration of high-dimensional functions with applications to finance (Journal of Complexity)](https://www.sciencedirect.com/science/article/pii/S0885064X10000452)\n17. [Dirk Pflüger (2012). Spatially Adaptive Refinement. Lecture notes in computational science and engineering.](https://doi.org/10.1007/978-3-642-31703-3_12)\n18. [H.-J. Bungartz, S. Dirnstorfer (2003). Multivariate Quadrature on Adaptive Sparse Grids. Computing.](https://doi.org/10.1007/s00607-003-0016-4)\n19. [Sparse-grid combination technique error analysis (CWI report MAS-R9823)](https://www.cwi.nl/documents/199302/MAS-R9823.pdf)\n20. [G.W Wasilkowski, H Woźniakowski (1999). Weighted Tensor Product Algorithms for Linear Multivariate Problems. Journal of Complexity.](https://doi.org/10.1006/jcom.1999.0512)\n21. [Volker Barthelmann, Erich Novak, Klaus Ritter (2000). High dimensional polynomial interpolation on sparse grids. Advances in Computational Mathematics.](https://doi.org/10.1023/a:1018977404843)\n22. [Erich Novak, Klaus Ritter (1996). High dimensional integration of smooth functions over cubes. Numerische Mathematik.](https://doi.org/10.1007/s002110050231)\n23. [Markus Holtz (2010). Sparse Grid Quadrature in High Dimensions with Applications in Finance and Insurance. Lecture notes in computational science and engineering.](https://doi.org/10.1007/978-3-642-16004-2)\n24. [J. Garcke, M. Griebel, M. Thess (2001). Data Mining with Sparse Grids. Computing.](https://doi.org/10.1007/s006070170007)\n25. [The rate of convergence of sparse grid quadrature on the torus](https://journal.austms.org.au/ojs/index.php/ANZIAMJ/article/download/3952/1458)\n26. [A Numerical Comparison Between Quasi-Monte Carlo and Sparse Grid Stochastic Collocation Methods](https://www.global-sci.com/cicp/article/view/5994)\n27. [EXPANSIONS: a review and benchmark of sparse polynomial chaos expansions (ETH Zurich)](https://ethz.ch/content/dam/ethz/special-interest/baug/ibk/risk-safety-and-uncertainty-dam/publications/reports/RSUQ-2020-002.pdf)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Analysis and mathematical models › Numerical analysis and computation › Interpolation and approximation*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
"same_as": [
"https://people.sc.fsu.edu/~jburkardt/latex_src/sparse_interpolant_2013_fsu/sparse_interpolant_2013_fsu.pdf"
],
"url": "https://www.edgepedia.org/sparse-grid",
"markdown_url": "https://www.edgepedia.org/sparse-grid.md",
"license": {
"name": "Edgepedia Community License 1.0",
"url": "https://www.edgepedia.org/edgepedia/license",
"summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
"spdx": "LicenseRef-Edgepedia-Community-1.0"
},
"credit": "\"Sparse grid\", Edgepedia (EdgeChat), https://www.edgepedia.org/sparse-grid. Edgepedia Community License 1.0.",
"credit_md": "\"[Sparse grid](https://www.edgepedia.org/sparse-grid)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/sparse-grid](https://www.edgepedia.org/sparse-grid). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
"credit_html": "\"Sparse grid\", Edgepedia (EdgeChat), https://www.edgepedia.org/sparse-grid. Edgepedia Community License 1.0.",
"speakable": "A sparse grid is a numerical construction that represents high-dimensional functions on a subset of a full tensor-product grid, using the Smolyak algorithm, enabling quadrature, interpolation, and surrogate modeling in tens of dimensions."
}