Computing discrepancies of Smolyak quadrature rules
From MaRDI portal
Publication:2365409
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
Cited in
(14)- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
- On an interpolatory method for high dimensional integration
- An exact order of discrepancy of the Smolyak grid and some general conclusions in the theory of numerical integration
- Discrepancy of two-dimensional Smolyak grids
- Discrepancy of stratified samples from partitions of the unit cube
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- On the expected \(\mathcal{L}_2\)-discrepancy of jittered sampling
- Uniform distribution, discrepancy, and reproducing kernel Hilbert spaces
- Asymptotically optimal weighted numerical integration
- Entropy, Randomization, Derandomization, and Discrepancy
- Calculation of discrepancy measures and applications
- On the \(L_2\)-discrepancy for anchored boxes
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Fibonacci sets and symmetrization in discrepancy theory
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)
