Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
From MaRDI portal
Publication:2465281
DOI10.1016/j.jco.2007.02.001zbMath1130.65005OpenAlexW2111894258MaRDI QIDQ2465281
Friedrich Pillichshammer, Josef Dick
Publication date: 9 January 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.02.001
convergenceworst-case errormultivariate numerical integrationstrong tractabilityquasi-Monte Carlo algorithmpolynomial lattice rule
Monte Carlo methods (65C05) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)
Related Items
Quasi-Monte Carlo integration using digital nets with antithetics ⋮ Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration ⋮ Construction of interlaced scrambled polynomial lattice rules of arbitrary high order ⋮ Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights ⋮ A Tool for Custom Construction of QMC and RQMC Point Sets ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules ⋮ Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence ⋮ On the existence of higher order polynomial lattices based on a generalized figure of merit ⋮ Richardson Extrapolation of Polynomial Lattice Rules ⋮ Periodization strategy may fail in high dimensions ⋮ Constructing good higher order polynomial lattice rules with modulus of reduced degree ⋮ Construction algorithms for higher order polynomial lattice rules ⋮ On decompositions of multivariate functions ⋮ The smoothing effect of the ANOVA decomposition ⋮ Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration ⋮ On the approximation of smooth functions using generalized digital nets ⋮ Fast QMC Matrix-Vector Multiplication ⋮ The \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital nets ⋮ Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration ⋮ Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
Cites Work
- Point sets and sequences with small discrepancy
- Zur angenäherten Berechnung mehrfacher Integrale
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- A class of generalized Walsh functions
- Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
- Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
- Low-discrepancy point sets obtained by digital constructions over finite fields
- On the Numerical Integration of Walsh Series by Number-Theoretic Methods
- Construction algorithms for polynomial lattice rules for multivariate integration
- A lower estimate for the error of quadrature formulae for certain classes of functions
- Cyclic Digital Nets, Hyperplane Nets, and Multivariate Integration in Sobolev Spaces
- On the Walsh Functions
- Theory of Reproducing Kernels
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
