A criterion for the best approximation of constants by simple partial fractions

DOI10.1134/S0001434613010276zbMath1275.41034MaRDI QIDQ1947793

M. A. Komarov

Publication date: 26 April 2013

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

alternation characterizationapproximation by sums of reciprocals of linear functions

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20)

Related Items (6)

A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II ⋮ Extremal and approximative properties of simple partial fractions ⋮ Estimates of the best approximation of polynomials by simple partial fractions ⋮ Least deviation of logarithmic derivatives of algebraic polynomials from zero ⋮ Best approximation rate of constants by simple partial fractions and Chebyshev alternance ⋮ Algorithm for constructing simple partial fractions of the best approximation of constants

Cites Work

• Unnamed Item
• Chebyshev's alternance in the approximation of constants by simple partial fractions

This page was built for publication: A criterion for the best approximation of constants by simple partial fractions