The curse of dimensionality for numerical integration of smooth functions. II

DOI10.1016/j.jco.2013.10.007zbMath1286.65040arXiv1304.3372OpenAlexW2964286331MaRDI QIDQ2442811

Aicke Hinrichs, Mario Ullrich, Henryk Woźniakowski, Erich Novak

Publication date: 1 April 2014

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

Full work available at URL: https://arxiv.org/abs/1304.3372

zbMATH Keywords

numerical integrationintegrationcurse of dimensionalitytractabilityworst casesmooth \(d\)-variate function

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items (18)

The curse of dimensionality for numerical integration on general domains ⋮ Optimal recovery and volume estimates ⋮ ABC on IBC ⋮ Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series ⋮ Some Results on the Complexity of Numerical Integration ⋮ On weak tractability of the Clenshaw-Curtis Smolyak algorithm ⋮ On the Wasserstein distance between classical sequences and the Lebesgue measure ⋮ Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity ⋮ Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions ⋮ Algorithms and complexity for functions on general domains ⋮ The radii of sections of origin-symmetric convex bodies and their applications ⋮ On weak tractability of the Smolyak algorithm for approximation problems ⋮ Points on manifolds with asymptotically optimal covering radius ⋮ On a Kantorovich-Rubinstein inequality ⋮ The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative ⋮ Entropy and sampling numbers of classes of ridge functions ⋮ EC-tractability of approximation problems in function spaces defined over products of simplices ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• A geometric inequality and the complexity of computing volume
• Shape analysis via oriented distance functions
• Multivariate integration in \(C^{\infty}([0,1^{d})\) is not strongly tractable.]
• Uniform weak tractability
• The curse of dimensionality for the class of monotone functions and for the class of convex functions
• Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
• The curse of dimensionality for numerical integration of smooth functions
• Compactly supported solutions of functional-differential equations and their applications
• On the optimality of linear methods for operator approximation in convex classes of functions

This page was built for publication: The curse of dimensionality for numerical integration of smooth functions. II