Best approximation rate of constants by simple partial fractions and Chebyshev alternance
From MaRDI portal
Publication:745607
DOI10.1134/S0001434615050077zbMath1323.41028MaRDI QIDQ745607
Publication date: 14 October 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (7)
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 ⋮ Approximation by special differences of simplest fractions ⋮ Extremal and approximative properties of simple partial fractions ⋮ Estimates of the best approximation of polynomials by simple partial fractions ⋮ Approximation to constant functions by electrostatic fields due to electrons and positrons ⋮ Algorithm for constructing simple partial fractions of the best approximation of constants
Cites Work
- Sufficient condition for the best uniform approximation by simple partial fractions
- Uniqueness of a simple partial fraction of best approximation
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Examples related to best approximation by simple partial fractions
- Criterion for the appearance of singular nodes under interpolation by simple partial fractions
- Approximation properties of the most simple fractions
- 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
- Optimization of methods of solving ordinary differential equations with strongly oscillating solutions
- Inequalities for the Logarithmic Derivatives of a Polynomial
This page was built for publication: Best approximation rate of constants by simple partial fractions and Chebyshev alternance
