Chebyshev's Problem
The Chebyshev approximation problem is usually described as to find the polynomial (or the element of an Haar subspace) which uniformly best approximates a given continuous function. Most of the theoretical results forming the basis of this theory have not been explored by members of the St Petersbu...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Publishing House of the Romanian Academy
2001-08-01
|
| Series: | Journal of Numerical Analysis and Approximation Theory |
| Online Access: | https://ictp.acad.ro/jnaat/journal/article/view/700 |