
The authors are best approximating functions \(f\in C[\alpha, \beta]\) by functions of a \(m\)-parameter smooth subfamily \(M\) of \(C[\alpha, \beta]\), which satisfies the local and the global Haar condition. Under proper assumptions, the corresponding exchange algorithm will generate references, where the nonlinear error equation can be solved, if the error is sufficiently small, while the deviation in the references is not increasing and converging to the minimal deviation. If \(f\in C^2[\alpha, \beta]\) and if the approximating family is also smooth of the second-order, then the convergence is quadratic.
Best approximation, Chebyshev systems, Algorithms for approximation of functions, exchange algorithm for nonlinear approximants, Approximation by arbitrary nonlinear expressions; widths and entropy
Best approximation, Chebyshev systems, Algorithms for approximation of functions, exchange algorithm for nonlinear approximants, Approximation by arbitrary nonlinear expressions; widths and entropy
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
