Liberating the dimension for function approximation: standard information

DOI10.1016/j.jco.2011.02.002zbMath1227.65140OpenAlexW2070190615MaRDI QIDQ555029

Henryk Woźniakowski, Grzegorz W. Wasilkowski

Publication date: 22 July 2011

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2011.02.002

zbMATH Keywords

complexitytractabilitylinear informationfunction approximationstandard information

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Related Items (17)

Stable splittings of Hilbert spaces of functions of infinitely many variables ⋮ Liberating the Dimension for Function Approximation and Integration ⋮ Liberating the dimension for \(L_2\)-approximation ⋮ 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 ⋮ Tractability of infinite-dimensional integration in the worst case and randomized settings ⋮ Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight ⋮ Average case tractability of approximating ∞-variate functions ⋮ Quasi-Monte Carlo and \(\varepsilon\)-truncation dimension in ANOVA spaces ⋮ The cost of deterministic, adaptive, automatic algorithms: cones, not balls ⋮ 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

• Unnamed Item
• Unnamed Item
• 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
• Linear information versus function evaluations for \(L_2\)-approximation
• Tractability of multivariate problems. Volume I: Linear information
• Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
• On the power of standard information for multivariate approximation in the worst case setting
• Explicit cost bounds of algorithms for multivariate tensor product problems
• Complexity of weighted approximation over \(\mathbb{R}\)
• 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 decompositions of multivariate functions
• Liberating the Dimension for Function Approximation and Integration
• On the power of standard information for weighted approximation

This page was built for publication: Liberating the dimension for function approximation: standard information