On weak tractability of the Clenshaw-Curtis Smolyak algorithm
From MaRDI portal
Publication:2451171
DOI10.1016/j.jat.2014.03.012zbMath1295.41028arXiv1309.0360OpenAlexW2049211937MaRDI QIDQ2451171
Aicke Hinrichs, Mario Ullrich, Erich Novak
Publication date: 3 June 2014
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0360
Related Items
On tensor product approximation of analytic functions ⋮ A note on optimal Hermite interpolation in Sobolev spaces ⋮ Robust topology optimization based on stochastic collocation methods under loading uncertainties ⋮ Exponential convergence of an approximation problem for infinitely differentiable multivariate functions ⋮ Some Results on the Complexity of Numerical Integration ⋮ Exponential tractability of \(L_2\)-approximation with function values ⋮ Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity ⋮ Algorithms and complexity for functions on general domains ⋮ On weak tractability of the Smolyak algorithm for approximation problems ⋮ Unnamed Item ⋮ The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative ⋮ Optimal Birkhoff interpolation and Birkhoff numbers in some function spaces ⋮ EC-tractability of approximation problems in function spaces defined over products of simplices
Cites Work
- Tractability results for weighted Banach spaces of smooth functions
- Approximation of infinitely differentiable multivariate functions is not strongly tractable
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Deterministic and stochastic error bounds in numerical analysis
- Numerical integration using sparse grids
- Hyperbolic cross designs for approximation of random fields
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Multivariate integration in \(C^{\infty}([0,1^{d})\) is not strongly tractable.]
- Weighted tensor product algorithms for linear multivariate problems
- Simple cubature formulas with high polynomial exactness
- On the Smolyak cubature error for analytic functions
- High dimensional polynomial interpolation on sparse grids
- Uniform weak tractability
- Approximation of infinitely differentiable multivariate functions is intractable
- Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
- The curse of dimensionality for numerical integration of smooth functions. II
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting
- High dimensional integration of smooth functions over cubes
- Spline interpolation on sparse grids
- The curse of dimensionality for numerical integration of smooth functions
- Discrepancy Theory and Quasi-Monte Carlo Integration
- Sparse grids
- High-dimensional integration: The quasi-Monte Carlo way
- A Construction of Nonnegative Approximate Quadratures
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
