Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm
From MaRDI portal
Publication:1938427
DOI10.1007/s00211-012-0469-5zbMath1264.65030arXiv1109.4998MaRDI QIDQ1938427
Publication date: 4 February 2013
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4998
algorithm; numerical examples; lattice rules; cubature formula; worst case error; component-by-component algorithm
41A63: Multidimensional problems
41A55: Approximate quadratures
65D32: Numerical quadrature and cubature formulas
Related Items
Construction of interlaced polynomial lattice rules for infinitely differentiable functions, Computational Higher Order Quasi-Monte Carlo Integration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variance bounds and existence results for randomly shifted lattice rules
- Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights
- On the tractability of the Brownian bridge algorithm
- On the convergence rate of the component-by-component construction of good lattice rules
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Integration and approximation in arbitrary dimensions
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Approximate formulas for some functions of prime numbers
- Component-by-component construction of good lattice rules
- The construction of good extensible rank-1 lattices
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- 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 Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Finite-order Integration Weights Can be Dangerous
- Constructing Embedded Lattice Rules for Multivariate Integration
- Constructing Robust Good Lattice Rules for Computational Finance
- Efficient Weighted Lattice Rules with Applications to Finance
- Theory of Reproducing Kernels
