Research reports
Childpage navigation
Years: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991
Fast QMC matrix-vector multiplication
by J. Dick and F.Y. Kuo and Q.T. Le Gia and Ch. Schwab
(Report number 2015-07)
Abstract
Quasi-Monte Carlo (QMC) rules 1/N \sum_{n=0}^{N-1} f(\boldsymbol{y}_n A) can be used to approximate integrals of the form \int_{[0,1]^s} f(\boldsymbol{y} A) \,\mathrm{d} \boldsymbol{y}, where A is a matrix and \boldsymbol{y} is row vector. This type of integral arises for example from the simulation of a normal distribution with a general covariance matrix, from the approximation of the expectation value of solutions of PDEs with random coefficients, or from applications from statistics. In this paper we design QMC quadrature points \boldsymbol{y}_0, \ldots, \boldsymbol{y}_{N-1} \in [0,1]^s such that for the matrix Y = (\boldsymbol{y}_{0}^\top, \ldots, \boldsymbol{y}_{N-1}^\top)^\top whose rows are the quadrature points, one can use the fast Fourier transform to compute the matrix-vector product Y \boldsymbol{a}^\top, \boldsymbol{a} \in \mathbb{R}^s, in \mathcal{O}(N \log N) operations and at most s-1 extra additions. The proposed method can be applied to lattice rules, polynomial lattice rules and a certain type of Korobov p-set. The approach is illustrated computationally by three numerical experiments. The first test considers the generation of points with normal distribution and general covariance matrix, the second test applies QMC to high-dimensional, affine-parametric, elliptic partial differential equations with uniformly distributed random coefficients, and the third test addresses Finite-Element discretizations of elliptic partial differential equations with high-dimensional, log-normal random input data. All numerical tests show a significant speed-up of the computation times of the fast QMC matrix method compared to a conventional implementation as the dimension becomes large.
Keywords: Quasi-Monte Carlo, fast Fourier transform, lattice rule, polynomial lattice rule, Korobov $p$-set, high-dimensional integration, partial differential equations with random input.
BibTeX@Techreport{DKLS15_597, author = {J. Dick and F.Y. Kuo and Q.T. Le Gia and Ch. Schwab}, title = {Fast QMC matrix-vector multiplication}, institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich}, number = {2015-07}, address = {Switzerland}, url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2015/2015-07.pdf }, year = {2015} }
Disclaimer
© Copyright for documents on this server remains with the authors.
Copies of these documents made by electronic or mechanical means including
information storage and retrieval systems, may only be employed for
personal use. The administrators respectfully request that authors
inform them when any paper is published to avoid copyright infringement.
Note that unauthorised copying of copyright material is illegal and may
lead to prosecution. Neither the administrators nor the Seminar for
Applied Mathematics (SAM) accept any liability in this respect.
The most recent version of a SAM report may differ in formatting and style
from published journal version. Do reference the published version if
possible (see SAM
Publications).