| |
| | [No title] |
 | | This improves, by factor $\log n$, the known arithmetic time bound for Chebyshev interpolation and gives an alternative supporting algorihtm for the record estimate of $O(n \log n)$ for Chebyshev evaluation, obtained by Gerasoulis in 1987 and based on a distinct algorithm. |
 | | In the next section, we recall the known correlationsbetween the Chebyshev set and the roots of 1. |
 | | This, however,immediately follows from (\ref{eq5.2}) and from the equation $p(x) = r(z)$, implied by (\ref{eq3.2}) and (\ref{eq5.3}). |
| comet.lehman.cuny.edu /vpan/fromVAX/chebyshev98_150.tex (1214 words) |
|