A computable figure of merit for quasi-Monte Carlo point sets
DOI10.1090/S0025-5718-2013-02774-3zbMath1330.11051arXiv1109.3873MaRDI QIDQ5401700
Makoto Matsumoto, Kyle Matoba, Mutsuo Saito
Publication date: 12 March 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3873
numerical integrationWalsh functionslow discrepancy sequencesdigital netsquasi-Monte Carlocomputational financefigure of meritWAFOM
Monte Carlo methods (65C05) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Construction algorithms for higher order polynomial lattice rules
- Duality theory and propagation rules for higher order nets
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Explicit constructions in the classical mean squares problem in irregularities of point distribution
- Existence of Higher Order Convergent Quasi-Monte Carlo Rules via Walsh Figure of Merit
- Dyadic diaphony
- On Quasi-Monte Carlo Rules Achieving Higher Order Convergence
- Harmonic analysis on totally disconnected groups and irregularities of point distributions
- Duality theory and propagation rules for generalized digital nets
- Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
- Good error-correcting codes based on very sparse matrices
This page was built for publication: A computable figure of merit for quasi-Monte Carlo point sets