Infinite-dimensional integration and the multivariate decomposition method
From MaRDI portal
cubaturereproducing kernel Hilbert spacealgorithmerror boundquadratureLebesgue integrationinfinite-dimensionalmultivariate decomposition method
Numerical quadrature and cubature formulas (65D32) Multidimensional problems (41A63) Approximate quadratures (41A55) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Integration of real functions of several variables: length, area, volume (26B15)
Abstract: We further develop the emph{Multivariate Decomposition Method} (MDM) for the Lebesgue integration of functions of infinitely many variables with respect to a corresponding product of a one dimensional probability measure. Although a number of concepts of infinite-dimensional integrals have been used in the literature, questions of uniqueness and compatibility have mostly not been studied. We show that, under appropriate convergence conditions, the Lebesgue integral equals the `anchored' integral, independently of the anchor. The MDM assumes that point values of are available for important subsets , at some known cost. In this paper we introduce a new setting, in which it is assumed that each belongs to a normed space , and that bounds on are known. This contrasts with the assumption in many papers that weights , appearing in the norm of the infinite-dimensional function space, are somehow known. Often such weights were determined by minimizing an error bound depending on the , the emph{and} the chosen algorithm, resulting in weights that depend on the algorithm. In contrast, in this paper only the bounds are assumed known. We give two examples in which we specialize the MDM: in the first case is the -fold tensor product of an anchored reproducing kernel Hilbert space, and in the second case it is a particular non-Hilbert space for integration over an unbounded domain.
Recommendations
- Efficient implementations of the multivariate decomposition method for approximating infinite-variate integrals
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
- Infinite-dimensional integration on weighted Hilbert spaces
- Liberating the dimension
Cites work
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3443893 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
- Average case tractability of approximating \(\infty\)-variate functions
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Correction to ``Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond
- Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
- Explicit cost bounds of algorithms for multivariate tensor product problems
- High-dimensional integration: The quasi-Monte Carlo way
- Higher order QMC Petrov-Galerkin discretization for affine parametric operator equations with random field inputs
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- Infinite-dimensional integration on weighted Hilbert spaces
- Infinite-dimensional quadrature and approximation of distributions
- Liberating the dimension
- Liberating the dimension for \(L_2\)-approximation
- Liberating the dimension for function approximation
- Liberating the dimension for function approximation and integration
- Liberating the dimension for function approximation: standard information
- Lower error bounds for randomized multilevel and changing dimension algorithms
- Monte Carlo simulation of stochastic integrals when the cost of function evaluation is dimension dependent
- Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Multi-level quasi-Monte Carlo finite element methods for a class of elliptic PDEs with random coefficients
- Multilevel Quasi-Monte Carlo methods for lognormal diffusion problems
- Multilevel higher order QMC Petrov-Galerkin discretization for affine parametric operator equations
- On decompositions of multivariate functions
- On the choice of weights in a function space for quasi-Monte Carlo methods for a class of generalised response models in statistics
- On the quasi-Monte Carlo method with halton points for elliptic PDEs with log-normal diffusion
- On tractability of linear tensor product problems for \(\infty \)-variate classes of functions
- On tractability of path integration
- On weighted Hilbert spaces and integration of functions of infinitely many variables
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients
- Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients
- Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
- Scrambled polynomial lattice rules for infinite-dimensional integration
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
- Tractability of infinite-dimensional integration in the worst case and randomized settings
- Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Cited in
(13)- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
- Approximation of high-dimensional periodic functions with Fourier-based methods
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Sparse additive function decompositions facing basis transforms
- On equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in \(L_1\) or \(L_\infty\)
- Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
- \( \varepsilon \)-superposition and truncation dimensions in average and probabilistic settings for \(\infty \)-variate linear problems
- MDFEM: multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficients using higher-order QMC and FEM
- Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
- The uniform sparse FFT with application to PDEs with random coefficients
- Efficient implementations of the multivariate decomposition method for approximating infinite-variate integrals
- On efficient weighted integration via a change of variables
- MDFEM: multivariate decomposition finite element method for elliptic PDEs with uniform random diffusion coefficients using higher-order QMC and FEM
This page was built for publication: Infinite-dimensional integration and the multivariate decomposition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012602)