The exact exponent of sparse grid quadratures in the weighted case
From MaRDI portal
Publication:1347862
DOI10.1006/jcom.2001.0598zbMath0997.65001OpenAlexW1991092247MaRDI QIDQ1347862
Leszek Plaskota, Grzegorz W. Wasilkowski
Publication date: 17 November 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0598
algorithmsmultivariate integrationexponent of strong tractabilitysparse grid quadraturesstrong tractability problemweighted tensor product spaces
Related Items
A constructive approach to strong tractability using quasi-Monte Carlo algorithms ⋮ Dimension-wise integration of high-dimensional functions with applications to finance
Cites Work
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Weighted tensor product algorithms for linear multivariate problems
- The exponent of discrepancy of sparse grids is at least 2. 1933
- Intractability results for integration and discrepancy
This page was built for publication: The exact exponent of sparse grid quadratures in the weighted case