The fast reduced QMC matrix-vector product

by   Josef Dick, et al.

We study the approximation of integrals ∫_D f(x^⊤ A) dμ(x), where A is a matrix, by quasi-Monte Carlo (QMC) rules N^-1∑_k=0^N-1 f(x_k^⊤ A). We are interested in cases where the main cost arises from calculating the products x_k^⊤ A. We design QMC rules for which the computation of x_k^⊤ A, k = 0, 1, …, N-1, can be done fast, and for which the error of the QMC rule is similar to the standard QMC error. We do not require that A has any particular structure. For instance, this approach can be used when approximating the expected value of a function with a multivariate normal random variable with a given covariance matrix, or when approximating the expected value of the solution of a PDE with random coefficients. The speed-up of the computation time is sometimes better and sometimes worse than the fast QMC matrix-vector product from [Dick, Kuo, Le Gia, and Schwab, Fast QMC Matrix-Vector Multiplication, SIAM J. Sci. Comput. 37 (2015)]. As in that paper, our approach applies to (polynomial) lattice point sets, but also to digital nets (we are currently not aware of any approach which allows one to apply the fast method from the aforementioned paper of Dick, Kuo, Le Gia, and Schwab to digital nets). Our method does not use FFT, instead we use repeated values in the quadrature points to derive a reduction in the computation time. This arises from the reduced CBC construction of lattice rules and polynomial lattice rules. The reduced CBC construction has been shown to reduce the computation time for the CBC construction. Here we show that it can also be used to also reduce the computation time of the QMC rule.


page 1

page 2

page 3

page 4


Weighted integration over a cube based on digital nets and sequences

Quasi-Monte Carlo (QMC) methods are equal weight quadrature rules to app...

Computation of the expected value of a function of a chi-distributed random variable

We consider the problem of numerically evaluating the expected value of ...

On a reduced digit-by-digit component-by-component construction of lattice point sets

In this paper, we study an efficient algorithm for constructing point se...

A Tool for Custom Construction of QMC and RQMC Point Sets

We present LatNet Builder, a software tool to find good parameters for l...

A note on the CBC-DBD construction of lattice rules with general positive weights

Lattice rules are among the most prominently studied quasi-Monte Carlo m...

Exploration of a Cosine Expansion Lattice Scheme

In this article, we combine a lattice sequence from Quasi-Monte Carlo ru...

KarNet: An Efficient Boolean Function Simplifier

Many approaches such as Quine-McCluskey algorithm, Karnaugh map solving,...

Please sign up or login with your details

Forgot password? Click here to reset