Sufficient condition for the best uniform approximation by simple partial fractions (Q354822)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sufficient condition for the best uniform approximation by simple partial fractions |
scientific article; zbMATH DE number 6189867
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient condition for the best uniform approximation by simple partial fractions |
scientific article; zbMATH DE number 6189867 |
Statements
Sufficient condition for the best uniform approximation by simple partial fractions (English)
0 references
22 July 2013
0 references
Let \(f\) be a real-valued continuous function on \([-1,1]\). Under the assumption that a certain algebraic identity holds, the author shows that if \(R_n\) is a simple partial fraction of degree at most \(n\) whose poles are simple and are outside the unit disk then it is a best uniform approximation to \(f\) from the set of all simple partial fractions of degree at most \(n\), provided that \(f-R_n\) has a Chebyshev alternation of \(n+1\) points on \([-1,1]\). The result is applied to the problem of approximation of real constants. The algebraic identity mentioned above depends on \(n\). The present article contains a proof for \(n=3\), and the author points out that so far its validity has only been verified for \(n \leq 5\).
0 references
rational approximation
0 references
Chebyshev alternation
0 references
simple partial fraction
0 references
partial fraction decomposition
0 references
0.9348486
0 references
0.9154635
0 references
0.91410255
0 references
0.9057635
0 references
0.8914153
0 references
0.8902595
0 references
0.88528025
0 references
0.8834106
0 references