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 algori...
Saved in:
| Date: | 1994 |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | Ukrainian English |
| Published: |
Institute of Mathematics, NAS of Ukraine
1994
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/5673 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |