Construction of quasi-Monte Carlo rules for multivariate integration in spaces of permutation-invariant functions
KU Leuven（荷语鲁汶大学）；VITO, Energy Technology（维托能源技术研究所）；Philipps-University Marburg, Faculty of Mathematics and Computer Science（马尔堡菲利普斯大学数学与计算机学院）；University of Siegen, Department of Mathematics（锡根大学数学系）
We study multivariate integration of functions that are invariant under the permutation (of a subset) of their arguments. Recently, in Nuyens, Suryanarayana, and Weimar (Adv. Comput. Math. (2016), 42(1):55--84), the authors derived an upper estimate for the $n$th minimal worst case error for such problems, and showed that under certain conditions this upper bound only weakly depends on the dimension. We extend these results by proposing two (semi-) explicit construction schemes. We develop a component-by-component algorithm to find the generating vector for a shifted rank-$1$ lattice rule that obtains a rate of convergence arbitrarily close to $\mathcal{O}(n^{-α})$, where $α>1/2$ denotes the smoothness of our function space and $n$ is the number of cubature nodes. Further, we develop a semi-constructive algorithm that builds on point sets which can be used to approximate the integrands of interest with a small error; the cubature error is then bounded by the error of approximation. Here the same rate of convergence is achieved while the dependence of the error bounds on the dimension $d$ is significantly improved.
Numerical integration is a classical problem emerging in many fields of science. Multivariate integration cannot be approached with classical methods due to the exponential growth of the number of quadrature nodes. We propose a method to overcome this problem. Tensor-train decomposition of a tensor approximating the integrand is constructed and used to evaluate a multivariate quadrature formula. We show how to deal with singularities in the integration domain and conduct theoretical analysis of the integration accuracy. The reference open-source implementation is provided.
The \emph{deterministic} sparse grid method, also known as Smolyak's method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about \emph{randomized} versions of the sparse grid method. In this paper we analyze randomized sparse grid algorithms, namely randomized sparse grid quadratures for multivariate integration on the $D$-dimensional unit cube $[0,1)^D$. Let $d,s \in \mathbb{N}$ be such that $D=d\cdot s$. The $s$-dimensional building blocks of the sparse grid quadratures are based on stratifie…
Splitting schemes are numerical integrators for Hamiltonian problems that may advantageously replace the Störmer-Verlet method within Hamiltonian Monte Carlo (HMC) methodology. However, HMC performance is very sensitive to the step size parameter; in this paper we propose a new method in the one-parameter family of second-order of splitting procedures that uses a well-fitting parameter that nullifies the expectation of the energy error for univariate and multivariate Gaussian distributions, taken as a problem-guide for more realistic situations; we also provide a new algorithm that through an …
