Construction algorithms for good extensible lattice rules

DOI10.1007/s00365-009-9065-zzbMath1247.11100OpenAlexW2076410988MaRDI QIDQ843720

Harald Niederreiter, Friedrich Pillichshammer

Publication date: 15 January 2010

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-009-9065-z

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (6)

Accelerating the Convergence of Lattice Methods by Importance Sampling-Based Transformations ⋮ Extensible hyperplane nets ⋮ Ian Sloan and Lattice Rules ⋮ Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness ⋮ Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights ⋮ Proof techniques in quasi-Monte Carlo theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Zur angenäherten Berechnung mehrfacher Integrale
• On the convergence rate of the component-by-component construction of good lattice rules
• Existence of good lattice points in the sense of Hlawka
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Tractability of multivariate integration for weighted Korobov classes
• The existence of good extensible rank-1 lattices
• Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
• My dream quadrature rule
• The existence of good extensible polynomial lattice rules
• Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
• Component-by-component construction of good lattice rules with a composite number of points
• Liberating the weights
• Searching for extensible Korobov rules
• A class of generalized Walsh functions
• The construction of good extensible rank-1 lattices
• The construction of extensible polynomial lattice rules with small weighted star discrepancy
• Low-discrepancy point sets obtained by digital constructions over finite fields
• Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature
• Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
• Construction algorithms for polynomial lattice rules for multivariate integration
• Constructing Embedded Lattice Rules for Multivariate Integration
• Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
• Constructions of general polynomial lattices for multivariate integration

This page was built for publication: Construction algorithms for good extensible lattice rules