Algorithm for Constructing Simple Partial Fractions of the Best Approximation of Constants


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

It is known that for the best uniform approximation of real constants c by simple partial fractions ρn of order n on a real segment it is necessary and sufficient to have an alternance of n + 1 points on this segment for the difference ρn − c, n ≥ n0(c). We propose an algorithm for constructing the alternance and simple partial fraction of the best approximation of constants c.

作者简介

V. Danchenko

A. G. and N. G. Stoletov Vladimir State University

编辑信件的主要联系方式.
Email: vdanch2012@yandex.ru
俄罗斯联邦, 87, Gor’kogo St., Vladimir, 600000

E. Kondakova

A. G. and N. G. Stoletov Vladimir State University

Email: vdanch2012@yandex.ru
俄罗斯联邦, 87, Gor’kogo St., Vladimir, 600000

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2019