On the convergence rate of the component-by-component construction of good lattice rules
From MaRDI portal
Publication:876817
DOI10.1016/j.jco.2003.11.008zbMath1344.65034OpenAlexW2015558767MaRDI QIDQ876817
Publication date: 30 April 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.11.008
Related Items
Very low truncation dimension for high dimensional integration under modest error demand ⋮ QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND ⋮ Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions ⋮ Construction algorithms for good extensible lattice rules ⋮ Constructing lattice rules based on weighted degree of exactness and worst case error ⋮ Reducing the construction cost of the component-by-component construction of good lattice rules ⋮ Randomly shifted lattice rules for unbounded integrands ⋮ Construction algorithms for polynomial lattice rules for multivariate integration ⋮ On combined component-by-component constructions of lattice point sets ⋮ QMC Galerkin Discretization of Parametric Operator Equations ⋮ The construction of good extensible Korobov rules ⋮ On a projection-corrected component-by-component construction ⋮ Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm ⋮ Error Estimate of a Quasi-Monte Carlo Time-Splitting Pseudospectral Method for Nonlinear Schrödinger Equation with Random Potentials ⋮ On a reduced component-by-component digit-by-digit construction of lattice point sets ⋮ Variance bounds and existence results for randomly shifted lattice rules ⋮ Numerical integration in log-Korobov and log-cosine spaces ⋮ A note on the CBC-DBD construction of lattice rules with general positive weights ⋮ Lattice rules for nonperiodic smooth integrands ⋮ Ian Sloan and Lattice Rules ⋮ Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm ⋮ A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights ⋮ Lattice rules in non-periodic subspaces of Sobolev spaces ⋮ Weighted compound integration rules with higher order convergence for all \(N\) ⋮ Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness ⋮ Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients ⋮ Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels ⋮ Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation ⋮ Periodization strategy may fail in high dimensions ⋮ Hiding the weights -- CBC black box algorithms with a guaranteed error bound ⋮ Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights ⋮ Randomly shifted lattice rules with the optimal rate of convergence for unbounded 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 ⋮ Liberating the dimension ⋮ Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces ⋮ Quasi-Monte Carlo methods can be efficient for integration over products of spheres ⋮ The construction of good extensible rank-1 lattices ⋮ CORRECTION TO “QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND” ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration ⋮ High-dimensional reliability analysis based on the improved number-theoretical method ⋮ Multi-level quasi-Monte Carlo finite element methods for a class of elliptic PDEs with random coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Tractability of multivariate integration for weighted Korobov classes
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Component-by-component construction of good lattice rules with a composite number of points
- Integration and approximation in arbitrary dimensions
- Component-by-component construction of good lattice rules
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- On Korobov Lattice Rules in Weighted Spaces
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Reducing the construction cost of the component-by-component construction of good lattice rules
- Efficient Weighted Lattice Rules with Applications to Finance
- Theory of Reproducing Kernels
