Complexity of weighted approximation over \(\mathbb{R}^d\)

DOI10.1006/jcom.2001.0601zbMath0997.65015OpenAlexW2049764483MaRDI QIDQ1347852

Grzegorz W. Wasilkowski, Henryk Woźniakowski

Publication date: 5 November 2002

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

Full work available at URL: https://doi.org/10.1006/jcom.2001.0601

zbMATH Keywords

algorithmsweighted approximationmultivariate functionsweighted integrationfinite complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)

Related Items

Set membership identification of nonlinear systems ⋮ Infinite-dimensional quadrature and approximation of distributions ⋮ Randomly shifted lattice rules for unbounded integrands ⋮ Derandomization of the Euler scheme for scalar stochastic differential equations ⋮ Computation of local radius of information in SM-IBC identification of nonlinear systems ⋮ Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) ⋮ Estimates of variation with respect to a set and applications to optimization problems ⋮ On the complexity of parabolic initial-value problems with variable drift ⋮ Complexity of Gaussian-radial-basis networks approximating smooth functions ⋮ Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\) ⋮ Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)

Cites Work

• Deterministic and stochastic error bounds in numerical analysis
• Explicit cost bounds of algorithms for multivariate tensor product problems
• Weighted tensor product algorithms for linear multivariate problems
• Complexity of weighted approximation over \(\mathbb{R}\)
• Unnamed Item
• Unnamed Item
• Unnamed Item