Convergence of an algorithm for constructing snakes

Authors

  • V. K. Dzyadyk
  • V. V. Kovtunets

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 class C2, this algorithm is quadratically convergent.

Published

25.07.1994

Issue

Section

Research articles

How to Cite

Dzyadyk, V. K., and V. V. Kovtunets. “Convergence of an Algorithm for Constructing Snakes”. Ukrains’kyi Matematychnyi Zhurnal, vol. 46, no. 7, July 1994, pp. 825–832, https://umj.imath.kiev.ua/index.php/umj/article/view/5673.