Convergence of an algorithm for constructing snakes
We investigate an algorithm for constructing snakes (extremal polynomials introduced by S. Karlin) suggested by Dzyadyk. It is proved that, in the general case, this algorithm is linearly convergent. In the case where the basis functions of the Chebyshev system belong to the class $C^2$, this algorithm is quadratically convergent.
English version (Springer): Ukrainian Mathematical Journal 46 (1994), no. 7, pp 903-911.
Citation Example: Dzyadyk V. K., Kovtunets V. V. Convergence of an algorithm for constructing snakes // Ukr. Mat. Zh. - 1994. - 46, № 7. - pp. 825–832.