
doi: 10.1007/bf01932717
The provision of algorithms for computing best Chebyshev approximations on a continuum by general linear combinations of continuous functions is considered. Four possible approaches are described, and detailed comparisons are given for some test problems.
Algorithms for approximation of functions, Numerical smoothing, curve fitting
Algorithms for approximation of functions, Numerical smoothing, curve fitting
| 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). | 8 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
