A new optimal algorithm for weighted approximation and integration over R

DOI10.1023/A:1019164403899zbMath0966.41018OpenAlexW1552022819MaRDI QIDQ1587019

Lei Han, Grzegorz W. Wasilkowski

Publication date: 22 November 2000

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019164403899

zbMATH Keywords

complexityoptimal algorithmsweighted approximations

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Approximate quadratures (41A55) Numerical integration (65D30)

Related Items (4)

Randomly shifted lattice rules for unbounded integrands ⋮ Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives ⋮ Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) ⋮ Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)

This page was built for publication: A new optimal algorithm for weighted approximation and integration over R