Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds on Walsh coefficients by dyadic difference and a new Koksma-Hlawka type inequality for Quasi-Monte Carlo integration

Published 10 Apr 2015 in math.NA | (1504.03175v2)

Abstract: In this paper we give a new Koksma-Hlawka type inequality for Quasi-Monte Carlo (QMC) integration. QMC integration of a function $f\colon[0,1)s\rightarrow \mathbb{R}$ by a finite point set $\mathcal{P}\subset [0,1)s$ is the approximation of the integral $I(f):=\int_{[0,1)s}f(\mathbf{x})\,d\mathbf{x}$ by the average $I_{\mathcal{P}}(f):=\frac{1}{|\mathcal{P}|}\sum_{\mathbf{x} \in \mathcal{P}}f(\mathbf{x})$. We treat a certain class of point sets $\mathcal{P}$ called digital nets. A Koksma-Hlawka type inequality is an inequality bounding the integration error $\text{Err}(f;\mathcal{P}):=I(f)-I_{\mathcal{P}}(f)$ by a bound of the form $|\text{Err}(f;\mathcal{P})|\le C\cdot |f|\cdot D(\mathcal{P})$. We can obtain a Koksma-Hlawka type inequality by estimating bounds on $|\hat{f}(\mathbf{k})|$, where $\hat{f}(\mathbf{k})$ is a generalized Fourier coefficient with respect to the Walsh system. In this paper we prove bounds on Walsh coefficients $\hat{f}(\mathbf{k})$ by introducing an operator called `dyadic difference' $\partial_{i,n}$. By converting dyadic differences $\partial_{i,n}$ to derivatives $\frac{\partial }{\partial x_i}$, we get a new bound on $|\hat{f}(\mathbf{k})|$ for a function $f$ whose mixed partial derivatives up to order $\alpha$ in each variable are continuous. This new bound is smaller than the known bound on $|\hat{f}(\mathbf{k})|$ under some condition. The new Koksma-Hlawka inequality is derived using this new bound on the Walsh coefficients.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.