On low discrepancy sequences and low discrepancy ergodic transformations of the multidimensional unit cube
From MaRDI portal
Publication:607826
DOI10.1007/s11856-010-0058-1zbMath1219.11116OpenAlexW1987371226MaRDI QIDQ607826
Publication date: 6 December 2010
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-010-0058-1
Related Items
On the lower bound in the lattice point remainder problem for a parallelepiped ⋮ Recent constructions of low-discrepancy sequences ⋮ Transfer matrix method for determination of the natural vibration characteristics of elastically coupled launch vehicle boosters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequences, discrepancies and applications
- Suites dont la discrépance est comparable à un logarithme. (Sequences whose discrepancy is like a logarithm)
- Ergodic theory on \(SL(n)\), diophantine approximations and anomalies in the lattice point problem
- Van der Corput sequences, Kakutani transforms and one-dimensional numerical integration
- Central limit theorems for the ergodic adding machine
- Probabilistic diophantine approximation. I: Kronecker sequences
- Linear equations in variables which lie in a multiplicative group
- Estimates of the deviation of optimal meshes in \(L_ p\)-norm and the theory of quadrature formulas
- Construction of two dimensional low discrepancy sequences
- On Irregularities of Distribution II
- On logarithmically small errors in the lattice point problem
- Higher cohomology for Abelian groups of toral automorphisms
- On the distribution of points in a cube and the approximate evaluation of integrals
- On Lacunary Trigonometric Series
- Geometric discrepancy. An illustrated guide
- Randomness in lattice point problems
This page was built for publication: On low discrepancy sequences and low discrepancy ergodic transformations of the multidimensional unit cube
