A criterion for the solvability of the multiple interpolation problem by simple partial fractions
From MaRDI portal
Publication:483467
DOI10.1134/S0037446614040041zbMath1317.41004MaRDI QIDQ483467
Publication date: 17 December 2014
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Related Items (3)
Approximation by linear fractional transformations of simple partial fractions and their differences ⋮ Approximation by special differences of simplest fractions ⋮ Extremal and approximative properties of simple partial fractions
Cites Work
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Criterion for the appearance of singular nodes under interpolation by simple partial fractions
- Interpolation of rational functions by simple partial fractions
- Approximation by simple fractions
- Approximation by simple partial fractions and their generalizations
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
This page was built for publication: A criterion for the solvability of the multiple interpolation problem by simple partial fractions
