Abstract
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 classC 2, this algorithm is quadratically convergent.
Similar content being viewed by others
References
L. B. Shevchuk,Construction of Snakes and Their Applications [in Russian], Candidate of Sciences Dissertation (Physics and Mathematics), Institute of Mathematics, Ukrainian Academy of Sciences, Kiev (1989).
V. K. Dzyadyk,Introduction to the Theory of Uniform Approximation of Functions by Polynomials [in Russian], Nauka, Moscow (1977).
M. G. Krein and A. A. Nudel'man,Markov Moment Problem and Extremal Problems [in Russian], Nauka, Moscow (1976).
V. F. Dem'yanov and V. N. Malozemov,Introduction to Minimax [in Russian], Nauka, Moscow (1972).
E. Ya. Remez,Fundamentals of the Numerical Methods of Chebyshev Approximation [in Russian], Naukova Dumka, Kiev (1969).
V. V. Kovtunets, “A generalization of S. N. Bernstein's parametric method,”Ukr. Mat. Zh.,35, No. 6, 689–695 (1983).
L. Collatz and W. Krabs,Approximations Theorie. Tschebyscheffsche Approximation mit Anwendungen, Teubner, Stuttgart (1973).
Author information
Authors and Affiliations
Additional information
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 7, pp. 825–832, July, 1994.
Rights and permissions
About this article
Cite this article
Dzyadyk, V.K., Kovtunets, V.V. Convergence of an algorithm for constructing snakes. Ukr Math J 46, 903–911 (1994). https://doi.org/10.1007/BF01056667
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01056667