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

From MaRDI portal
Publication:630203

DOI10.1134/S0081543810030065zbMath1214.41004MaRDI QIDQ630203

E. N. Kondakova, Vladimir I. Danchenko

Publication date: 17 March 2011

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)




Related Items (18)

Approximation by linear fractional transformations of simple partial fractions and their differencesSufficient condition for the best uniform approximation by simple partial fractionsUniqueness of a simple partial fraction of best approximationA criterion for the best uniform approximation by simple partial fractions in terms of alternance. IIExtremal properties of logarithmic derivatives of polynomialsA criterion for the best approximation of constants by simple partial fractionsAn example of non-uniqueness of a simple partial fraction of the best uniform approximationApproximation by special differences of simplest fractionsA criterion for the solvability of the multiple interpolation problem by simple partial fractionsExtremal and approximative properties of simple partial fractionsCriteria for the best approximation by simple partial fractions on semi-axis and axisExamples related to best approximation by simple partial fractionsLeast deviation of logarithmic derivatives of algebraic polynomials from zeroApproximation to constant functions by electrostatic fields due to electrons and positronsInterpolation of rational functions by simple partial fractionsCriterion for the appearance of singular nodes under interpolation by simple partial fractionsBest approximation rate of constants by simple partial fractions and Chebyshev alternanceAlgorithm for constructing simple partial fractions of the best approximation of constants



Cites Work


This page was built for publication: Chebyshev's alternance in the approximation of constants by simple partial fractions