Algorithm for constructing simple partial fractions of the best approximation of constants

DOI10.1007/S10958-019-04306-WMaRDI QIDQ2314296zbMATH OpenOpenAlexWikidataFDO

Authors E. N. Kondakova, Vladimir Danchenko

Publication date 22 July 2019

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-019-04306-w

Mathematics Subject Classification ID

Approximate quadratures (41A55)

Recommendations

• A criterion for the best approximation of constants by simple partial fractions
• Chebyshev's alternance in the approximation of constants by simple partial fractions
• An analog of the Haar condition for simple partial fractions
• Sufficient condition for the best uniform approximation by simple partial fractions
• Best approximation rate of constants by simple partial fractions and Chebyshev alternance

Cites work

• A criterion for the best approximation of constants by simple partial fractions
• Approximation by simple fractions
• Approximation properties of the most simple fractions
• Best approximation rate of constants by simple partial fractions and Chebyshev alternance
• Chebyshev's alternance in the approximation of constants by simple partial fractions
• Examples related to best approximation by simple partial fractions
• Extremal and approximative properties of simple partial fractions
• Inequalities for the Logarithmic Derivatives of a Polynomial
• Uniqueness of a simple partial fraction of best approximation

Cited in

(2)

• A criterion for the best approximation of constants by simple partial fractions
• A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II

This page was built for publication: Algorithm for constructing simple partial fractions of the best approximation of constants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314296)