Computational complexity in worst, stochastic and average case setting on functional approximation problem of multivariate

DOI10.1016/S0252-9602(05)60007-0zbMath1192.65172OpenAlexW2784069981MaRDI QIDQ2569255

Pei Xin Ye, Gen Sun Fang

Publication date: 18 October 2005

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(05)60007-0

zbMATH Keywords

error estimatesfunctional approximationaverage case setting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximate quadratures (41A55) Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30)

Related Items (2)

Exact asymptotic orders of various randomized widths on Besov classes ⋮ Computational complexity of the integration problem for anisotropic classes

This page was built for publication: Computational complexity in worst, stochastic and average case setting on functional approximation problem of multivariate