A Construction of Polynomial Lattice Rules with Small Gain Coefficients

Details A Construction of Polynomial Lattice Rules with Small Gain Coefficients A Construction of Polynomial Lattice Rules with Small Gain Coefficients

2010-03-25

arxiv.org/abs/1003.4785v2

Mathematics

Numerical Analysis

Scientific paper

In this paper we construct polynomial lattice rules which have, in some sense, small gain coefficients using a component-by-component approach. The gain coefficients, as introduced by Owen, indicate to what degree the method improves upon Monte Carlo. We show that the variance of an estimator based on a scrambled polynomial lattice rule constructed component-by-component decays at a rate of $N^{-(2\alpha + 1) +\delta}$, for all $\delta >0$, assuming that the function under consideration has bounded fractional variation of order $\alpha$ and where $N$ denotes the number of quadrature points. An analogous result is obtained for Korobov polynomial lattice rules. It is also established that these rules are almost optimal for the function space considered in this paper. Furthermore, we discuss the implementation of the component-by-component approach and show how to reduce the computational cost associated with it. Finally, we present numerical results comparing scrambled polynomial lattice rules and scrambled digital nets.

Affiliated with

Also associated with

No associations

Rating

A Construction of Polynomial Lattice Rules with Small Gain Coefficients does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Construction of Polynomial Lattice Rules with Small Gain Coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Construction of Polynomial Lattice Rules with Small Gain Coefficients will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555806