The construction of good lattice rules and polynomial lattice rules
arXiv:1308.3601 · doi:10.1515/9783110317930.223
Abstract
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the function space. The focus is on algebraic rates of convergence for and any , where is the decay of a series representation of the integrand function. The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different dimensions. Different types of weights are discussed. The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all ; but the case is special from the construction point of view. For the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.
References in corpus (2)
Cited by in corpus (10)
- Quantum Quasi-Monte Carlo algorithm for out-of-equilibrium Green functions at long times
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Hierarchical adaptive sparse grids and quasi Monte Carlo for option pricing under the rough Bergomi model
- Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing
- Inchworm quasi Monte Carlo for quantum impurities
- Strang splitting in combination with rank- and rank- lattices for the time-dependent Schrödinger equation
- Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks
- Lattice meets lattice: Application of lattice cubature to models in lattice gauge theory
- Higher order Quasi-Monte Carlo integration for holomorphic, parametric operator equations
- The analysis of vertex modified lattice rules in a non-periodic Sobolev space