Optimality of quasi-Monte Carlo methods and suboptimality of the sparse-grid Gauss--Hermite rule in Gaussian Sobolev spaces
By: Yoshihito Kazashi, Yuya Suzuki, Takashi Goda
Potential Business Impact:
Makes computer math problems solve faster.
Optimality of several quasi-Monte Carlo methods and suboptimality of the sparse-grid quadrature based on the univariate Gauss--Hermite rule is proved in the Sobolev spaces of mixed dominating smoothness of order $\alpha$, where the optimality is in the sense of worst-case convergence rate. For sparse-grid Gauss--Hermite quadrature, lower and upper bounds are established, with rates coinciding up to a logarithmic factor. The dominant rate is found to be only $N^{-\alpha/2}$ with $N$ function evaluations, although the optimal rate is known to be $N^{-\alpha}(\ln N)^{(d-1)/2}$. The lower bound is obtained by exploiting the structure of the Gauss--Hermite nodes and is independent of the quadrature weights; consequently, no modification of the weights can improve the rate $N^{-\alpha/2}$. In contrast, several quasi-Monte Carlo methods with a change of variables are shown to achieve the optimal rate, some up to, and one including, the logarithmic factor.
Similar Papers
A note on unshifted lattice rules for high-dimensional integration in weighted unanchored Sobolev spaces
Numerical Analysis
Finds better ways to solve hard math problems.
Fast and accurate computation of classical Gaussian quadratures
Numerical Analysis (Math)
Computers solve math problems faster and more accurately.
Fast and accurate computation of classical Gaussian quadratures
Numerical Analysis
Makes math problems solve much faster and better.