Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)

DOI10.1006/jcom.2001.0632zbMath1005.41017OpenAlexW4213027339MaRDI QIDQ1599206

Youming Li, Grzegorz W. Wasilkowski

Publication date: 5 February 2003

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

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

zbMATH Keywords

optimal algorithmscomplexity of approximation

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation algorithms (68W25)

Related Items

Worst case complexity of multivariate Feynman--Kac path integration, Randomly shifted lattice rules for unbounded integrands, Optimal algorithms for doubly weighted approximation of univariate functions, Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal quadrature algorithms in \(H_ p\) spaces
• Deterministic and stochastic error bounds in numerical analysis
• Asymptotically optimal weighted numerical integration
• Optimal integration of Lipschitz functions with a Gaussian weight
• Complexity of weighted approximation over \(\mathbb{R}^d\)
• Delayed curse of dimension for Gaussian integration
• A new optimal algorithm for weighted approximation and integration over R
• Complexity of weighted approximation over \(\mathbb{R}\)