Login / Signup
Lattice rules with random n achieve nearly the optimal O(n-α-1∕2) error independently of the dimension.
Peter Kritzer
Frances Y. Kuo
Dirk Nuyens
Mario Ullrich
Published in:
J. Approx. Theory (2019)
Keyphrases
</>
threshold values
error rate
estimation error
minimum error
optimal solution
approximation error
dynamic programming
classification rules
optimal design
error tolerance
closed form
optimal control
rough sets
globally optimal
relative error
state space
image sequences