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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

V. I. Danchenko

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

Author for correspondence.
Email: vdanch2012@yandex.ru
Russian Federation, 87, Gor’kogo St., Vladimir, 600000

E. N. Kondakova

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

Email: vdanch2012@yandex.ru
Russian Federation, 87, Gor’kogo St., Vladimir, 600000


Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies