A criterion for the best approximation of constants by simple partial fractions (Q1947793): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Chebyshev's alternance in the approximation of constants by simple partial fractions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5647003 / rank | |||
Normal rank | |||
Latest revision as of 09:18, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A criterion for the best approximation of constants by simple partial fractions |
scientific article |
Statements
A criterion for the best approximation of constants by simple partial fractions (English)
0 references
26 April 2013
0 references
A simple rational function is a sum of the reciprocals of \(n\) linear functions of the form \((x- x_i)\) defined on \([-1,1]\). This paper shows that, for sufficiently small numbers \(c\), the best approximation in the uniform norm to \(c\) by a simple rational function is characterized by the error function exhibiting \(n+1\) points of maximum amplitude but with alternating sign.
0 references
approximation by sums of reciprocals of linear functions
0 references
alternation characterization
0 references
