Liberating the dimension for L₂-approximation
From MaRDI portal
Publication:423879
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Recommendations
- Average case tractability of approximating -variate functions
- Multivariate approximation for analytic functions with Gaussian kernels
- scientific article; zbMATH DE number 2161076
- Average complexity for linear problems in a model with varying information noise
- Tractability of linear multivariate problems in the average case setting
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods
- Tractability results for weighted Banach spaces of smooth functions
- On the power of standard information for multivariate approximation in the worst case setting
- Approximation of infinitely differentiable multivariate functions is intractable
- Exponential tractability of \(L_2\)-approximation with function values
Cites work
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 53250 (Why is no real title available?)
- scientific article; zbMATH DE number 1273989 (Why is no real title available?)
- scientific article; zbMATH DE number 863752 (Why is no real title available?)
- scientific article; zbMATH DE number 270739 (Why is no real title available?)
- scientific article; zbMATH DE number 3282537 (Why is no real title available?)
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Infinite-dimensional integration on weighted Hilbert spaces
- Infinite-dimensional quadrature and approximation of distributions
- Liberating the dimension
- Liberating the dimension for function approximation
- Liberating the dimension for function approximation and integration
- Liberating the dimension for function approximation: standard information
- 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}\)
- On the topology of a polymer ring
- On tractability of path integration
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Tractability of infinite-dimensional integration in the worst case and randomized settings
- Weighted tensor product algorithms for linear multivariate problems
Cited in
(20)- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- On weighted Hilbert spaces and integration of functions of infinitely many variables
- The numerical approximation of nonlinear functionals and functional differential equations
- Truncation dimension for function approximation
- Quasi-Monte Carlo and \(\varepsilon\)-truncation dimension in ANOVA spaces
- Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness
- \( \varepsilon \)-superposition and truncation dimensions in average and probabilistic settings for \(\infty \)-variate linear problems
- Countable tensor products of Hermite spaces and spaces of Gaussian kernels
- Stable splittings of Hilbert spaces of functions of infinitely many variables
- Hyperbolic cross approximation in infinite dimensions
- On tractability of linear tensor product problems for \(\infty \)-variate classes of functions
- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
- Liberating the dimension for function approximation and integration
- Average case tractability of approximating -variate functions
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
- Exponential tractability of \(L_2\)-approximation with function values
- Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
- Infinite-dimensional integration and the multivariate decomposition method
- ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition
This page was built for publication: Liberating the dimension for \(L_2\)-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423879)
