Liberating the dimension for \(L_2\)-approximation
From MaRDI portal
Publication:423879
DOI10.1016/j.jco.2011.12.002zbMath1247.65013OpenAlexW2067683041MaRDI QIDQ423879
Publication date: 30 May 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.12.002
Analysis of algorithms and problem complexity (68Q25) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20)
Related Items (17)
Stable splittings of Hilbert spaces of functions of infinitely many variables ⋮ Countable tensor products of Hermite spaces and spaces of Gaussian kernels ⋮ Liberating the Dimension for Function Approximation and Integration ⋮ The numerical approximation of nonlinear functionals and functional differential equations ⋮ On tractability of linear tensor product problems for \(\infty \)-variate classes of functions ⋮ On weighted Hilbert spaces and integration of functions of infinitely many variables ⋮ Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives ⋮ Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight ⋮ Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence ⋮ Average case tractability of approximating ∞-variate functions ⋮ Quasi-Monte Carlo and \(\varepsilon\)-truncation dimension in ANOVA spaces ⋮ Infinite-dimensional integration and the multivariate decomposition method ⋮ Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition ⋮ Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness ⋮ Hyperbolic cross approximation in infinite dimensions ⋮ Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration ⋮ \( \varepsilon \)-superposition and truncation dimensions in average and probabilistic settings for \(\infty \)-variate linear problems
Cites Work
- Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Liberating the dimension for function approximation: standard information
- Liberating the dimension for function approximation
- Tractability of infinite-dimensional integration in the worst case and randomized settings
- Liberating the dimension
- Infinite-dimensional quadrature and approximation of distributions
- Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Weighted tensor product algorithms for linear multivariate problems
- Infinite-dimensional integration on weighted Hilbert spaces
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Monte Carlo Simulation of Stochastic Integrals when the Cost of Function Evaluation Is Dimension Dependent
- On the topology of a polymer ring
- On tractability of path integration
- Liberating the Dimension for Function Approximation and Integration
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Liberating the dimension for \(L_2\)-approximation
