Efficient implementations of the multivariate decomposition method for approximating infinite-variate integrals

DOI10.1137/17M1161890zbMATH Open1401.65028arXiv1712.06782OpenAlexW2964110034WikidataQ129142592 ScholiaQ129142592MaRDI QIDQ4685339FDOQ4685339

Authors: Alexander D. Gilbert, F. Y. Kuo, Dirk Nuyens, Grzegorz W. Wasilkowski 

Publication date: 8 October 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: In this paper we focus on efficient implementations of the Multivariate Decomposition Method (MDM) for approximating integrals of $infty$-variate functions. Such $infty$-variate integrals occur for example as expectations in uncertainty quantification. Starting with the anchored decomposition $f=su{m}_{mathfrakusubsetmathbbN}{f}_{m}athfraku$, where the sum is over all finite subsets of $mathbbN$ and each $f_{m}athfraku$ depends only on the variables $x_j$ with $jinmathfraku$, our MDM algorithm approximates the integral of $f$ by first truncating the sum to some `active set' and then approximating the integral of the remaining functions $f_{m}athfraku$ term-by-term using Smolyak or (randomized) quasi-Monte Carlo (QMC) quadratures. The anchored decomposition allows us to compute $f_{m}athfraku$ explicitly by function evaluations of $f$. Given the specification of the active set and theoretically derived parameters of the quadrature rules, we exploit structures in both the formula for computing $f_{m}athfraku$ and the quadrature rules to develop computationally efficient strategies to implement the MDM in various scenarios. In particular, we avoid repeated function evaluations at the same point. We provide numerical results for a test function to demonstrate the effectiveness of the algorithm.

Full work available at URL: https://arxiv.org/abs/1712.06782

Recommendations

• Infinite-dimensional integration and the multivariate decomposition method
• Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
• Liberating the dimension for function approximation and integration
• Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
• Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence

zbMATH Keywords

quasi-Monte Carloquadraturesparse gridsSmolyak's methodmultivariate decomposition methodinfinite-variate integral

Mathematics Subject Classification ID

Numerical integration (65D30)

Cites Work

• Title not available (Why is that?)
• Numerical integration using sparse grids
• Title not available (Why is that?)
• Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
• On decompositions of multivariate functions
• Title not available (Why is that?)
• High-dimensional integration: The quasi-Monte Carlo way
• Explicit cost bounds of algorithms for multivariate tensor product problems
• Liberating the dimension
• On tractability of linear tensor product problems for \(\infty \)-variate classes of functions
• Constructing Embedded Lattice Rules for Multivariate Integration
• Tractability of infinite-dimensional integration in the worst case and randomized settings
• Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
• Infinite-dimensional integration and the multivariate decomposition method
• Small superposition dimension and active set construction for multivariate integration under modest error demand

Cited In (8)

• Approximation of high-dimensional periodic functions with Fourier-based methods
• Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness
• Countable tensor products of Hermite spaces and spaces of Gaussian kernels
• Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
• Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
• MDFEM: multivariate decomposition finite element method for elliptic PDEs with uniform random diffusion coefficients using higher-order QMC and FEM
• Infinite-dimensional integration and the multivariate decomposition method
• MDFEM: multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficients using higher-order QMC and FEM

This page was built for publication: Efficient implementations of the multivariate decomposition method for approximating infinite-variate integrals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685339)