Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness

DOI10.1016/j.jco.2021.101555zbMath1481.65044arXiv2001.02978OpenAlexW3130576165MaRDI QIDQ1979419

Adrian Ebert, Peter Kritzer, Dirk Nuyens, Onyekachi Osisiogu

Publication date: 2 September 2021

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.02978

zbMATH Keywords

numerical integrationlattice pointsquasi-Monte Carlo methodscomponent-by-component constructionfast constructiondigit-by-digit construction

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)

Related Items (7)

Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces ⋮ Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction ⋮ Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights ⋮ Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate ⋮ On a reduced component-by-component digit-by-digit construction of lattice point sets ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ A note on the CBC-DBD construction of lattice rules with general positive weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
• A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
• Zur angenäherten Berechnung mehrfacher Integrale
• Construction algorithms for good extensible lattice rules
• On the convergence rate of the component-by-component construction of good lattice rules
• Tractability of multivariate problems. Volume I: Linear information
• 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
• Lattice rules in non-periodic subspaces of Sobolev spaces
• Successive coordinate search and component-by-component construction of rank-1 lattice rules
• Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm
• Lattice rules for nonperiodic smooth integrands
• Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
• Good lattice rules in weighted Korobov spaces with general weights
• Component-by-component construction of good lattice rules
• Lattice Rules for Multiple Integration and Discrepancy
• On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
• Error Bounds for the Method of Good Lattice Points
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• A generalized discrepancy and quadrature error bound
• Constructing QMC Finite Element Methods for Elliptic PDEs with Random Coefficients by a Reduced CBC Construction
• Introduction to Quasi-Monte Carlo Integration and Applications
• High-dimensional integration: The quasi-Monte Carlo way
• Efficient Weighted Lattice Rules with Applications to Finance

This page was built for publication: Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness