Average case complexity of multivariate integration for smooth functions
The computational complexity of multivariate integration is determined as the average case setting, in which cost and error of the approximating multivariate integrals are defined as the expected cost and error with respect to the folded Wiener sheet measure on the class of smooth functions. This average case complexity is derived by using a relation between the average and worst case settings. The main result of the paper is the evaluation of the average case complexity of an optimal algorithm for multivariate integration, where the computation of the optimal sample points, as well as their number, requires preprocessing which increases the computation cost. Also, a different set of fully constructive almost optimal points (that can be preprocessed by using the Monte Carlo algorithm) and an almost optimal algorithm are given with a reduced average case complexity.
- Average case complexity of multivariate integration
- Average case complexity of multivariate integration and function approximation. An Overview
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- Average case complexity of linear multivariate problems. I: Theory
- Average case complexity of linear multivariate problems. II: Applications
- Average case complexity of linear multivariate problems. I: Theory
- Average case complexity of linear multivariate problems. II: Applications
- Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions
- Scrambled net variance for integrals of smooth functions
- Quantum field theory for discrepancies
- Linear widths of a multivariate function space equipped with a Gaussian measure
- Worst case complexity of multivariate Feynman--Kac path integration
- On an interpolatory method for high dimensional integration
- Gaussian limits for discrepancies. I: Asymptotic results
- A probabilistic model for the numerical solution of initial value problems
- Average case complexity of multivariate integration and function approximation. An Overview
- A sparse grid space-time discretization scheme for parabolic problems
- Control variates for quasi-Monte Carlo (with comments and rejoinder)
- On tensor product approximation of analytic functions
- General algorithm for the numerical integration of functions of several variables
- Computational complexity of continuous problems
- scientific article; zbMATH DE number 4129391 (Why is no real title available?)
- Average case complexity of linear multivariate problems
- Average case complexity of multivariate integration
- On output functionals of boundary value problems on stochastic domains
- An exact order of discrepancy of the Smolyak grid and some general conclusions in the theory of numerical integration
- A survey of average case complexity for linear multivariate problems
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- Efficient algorithms for computing the L₂-discrepancy
- scientific article; zbMATH DE number 1421279 (Why is no real title available?)
- Calculation of discrepancy measures and applications
- On tractability of path integration
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\)
- What is the complexity of volume calculation?
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
- Principal manifold learning by sparse grids
- Approximative capabilities of ``Smolyak type computational aggregates with Dirichlet, Fejér and Vallée-Poussin kernels in the scale of Ul'yanov classes
This page was built for publication: Average case complexity of multivariate integration for smooth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260659)