Computing discrepancies of Smolyak quadrature rules
From MaRDI portal
Publication:2365409
DOI10.1006/JCOM.1996.0020zbMATH Open0869.41022OpenAlexW1975881124MaRDI QIDQ2365409FDOQ2365409
Authors: Karin Frank, Stefan Heinrich
Publication date: 3 August 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/191897d12255a6bd0ed7b9568b77648bcb97c3f3
Recommendations
- Smolyak cubature of given polynomial degree with few nodes for increasing dimension
- Efficient algorithms for computing the $L_2$-discrepancy
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- scientific article; zbMATH DE number 1103072
- Numerical integration using sparse grids
- Blending methods for two classical integrals
- Simple cubature formulas with high polynomial exactness
- Smolyak's construction of cubature formulas of arbitrary trigonometric degree
- Cubature formulas for function spaces with moderate smoothness
- An application of tensor products of functionals in problems of numerical integration
Approximate quadratures (41A55) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Cited In (14)
- On an interpolatory method for high dimensional integration
- Uniform distribution, discrepancy, and reproducing kernel Hilbert spaces
- Fibonacci sets and symmetrization in discrepancy theory
- Asymptotically optimal weighted numerical integration
- An exact order of discrepancy of the Smolyak grid and some general conclusions in the theory of numerical integration
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Calculation of Discrepancy Measures and Applications
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Discrepancy of stratified samples from partitions of the unit cube
- Discrepancy of two-dimensional Smolyak grids
- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
- Entropy, Randomization, Derandomization, and Discrepancy
- On the \(L_2\)-discrepancy for anchored boxes
- On the expected \(\mathcal{L}_2\)-discrepancy of jittered sampling
This page was built for publication: Computing discrepancies of Smolyak quadrature rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365409)