A criterion for the best uniform approximation by simple partial fractions in terms of alternance

DOI10.1070/IM2015V079N03ABEH002749zbMath1323.41017OpenAlexW2360371272MaRDI QIDQ5499983

M. A. Komarov

Publication date: 5 August 2015

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im2015v079n03abeh002749

zbMATH Keywords

uniquenessapproximationalternancesimple partial fractionsthe Haar condition

Mathematics Subject Classification ID

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

Related Items (11)

Approximation by linear fractional transformations of simple partial fractions and their differences ⋮ A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II ⋮ Rate of interpolation of analytic functions with regularly decreasing coefficients by simple partial fractions ⋮ Extremal properties of logarithmic derivatives of polynomials ⋮ Approximation by sums of shifts of a single function on the circle ⋮ Approximation by special differences of simplest fractions ⋮ On the rate of approximation in the unit disc of -functions by logarithmic derivatives of polynomials with zeros on the boundary ⋮ Extremal and approximative properties of simple partial fractions ⋮ Estimates of the best approximation of polynomials by simple partial fractions ⋮ Criteria for the best approximation by simple partial fractions on semi-axis and axis ⋮ Best approximation rate of constants by simple partial fractions and Chebyshev alternance

This page was built for publication: A criterion for the best uniform approximation by simple partial fractions in terms of alternance