A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
From MaRDI portal
Publication:5349256
DOI10.1070/IM8548zbMath1375.41009OpenAlexW4239190341MaRDI QIDQ5349256
Publication date: 24 August 2017
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im8548
Related Items (8)
Greedy approximation by arbitrary sets ⋮ Extremal properties of logarithmic derivatives of polynomials ⋮ 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 by sums of the form \(\sigma_k\lambda_k h(\lambda_kz)\) in the disk ⋮ Criteria for the best approximation by simple partial fractions on semi-axis and axis ⋮ Approximation to constant functions by electrostatic fields due to electrons and positrons
Cites Work
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Best approximation rate of constants by simple partial fractions and Chebyshev alternance
- Approximation by simple fractions
- Approximation properties of the most simple fractions
- A criterion for the best approximation of constants by simple partial fractions
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
- Approximation by simple partial fractions and the Hilbert transform
- Approximation by simple partial fractions on the semi-axis
- ESTIMATES OF THE DISTANCES FROM THE POLES OF LOGARITHMIC DERIVATIVES OF POLYNOMIALS TO LINES AND CIRCLES
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Unnamed Item
- Unnamed Item
This page was built for publication: A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
