Some nonlinear problems are as easy as the approximation problem
From MaRDI portal
Publication:2266192
DOI10.1016/0898-1221(84)90063-4zbMath0559.41018OpenAlexW1980738079WikidataQ126550503 ScholiaQ126550503MaRDI QIDQ2266192
Publication date: 1984
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(84)90063-4
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by positive operators (41A36)
Related Items (14)
A survey of information-based complexity ⋮ Sampling discretization and related problems ⋮ Uniform recovery of high-dimensional \(C^r\)-functions ⋮ Probabilistic setting of information-based complexity ⋮ Product rules are optimal for numerical integration in classical smoothness spaces ⋮ Optimal algorithms for a problem of optimal control ⋮ Sampling discretization error of integral norms for function classes ⋮ On the complexity of computing the \(L_q\) norm ⋮ Tractability for Volterra problems of the second kind with convolution kernels ⋮ \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace ⋮ Information of varying cardinality ⋮ On average case errors in numerical analysis ⋮ The power of standard information for multivariate approximation in the randomized setting ⋮ The average a posteriori error of numerical methods
Cites Work
This page was built for publication: Some nonlinear problems are as easy as the approximation problem