Extremal and approximative properties of simple partial fractions (Q1735152)

In this large survey article approximation with logarithmic derivatives of complex polynomials, i.e., with simple partial fractions (SPFs) and their modifications are considered. The analogy of metric problems of best approximation and interpolation in complex areas and real intervals systematically is studied. In particular, Gorin-Chebyshev's problem, Gorin-Gelfond problems, analogs of Zolotarev's problem, Jackson-Nikol'ski problem, the problem of interpolation by SPFs are tackled. As well Markov-Berstein's inequalities for derivatives of SPFs on the real axis, on circles and segments. The problem of interpolation of analytic functions by SPFs, the problem of generalized interpolation with simple nodes, generalized multiple interpolation by SPFs, interpolation of real constants, Pade interpolation are treated. An analog of Mergelyan's theorem is proved, the analog of the classical Jacson-Korneychuk theorem on estimating the deviations through the module of continuity is obtained. According to Remez algorithm in the theory of polynomial approximations the best polynomial approximation and the corresponding alternance of $n+2$ points can be constructed. Some analog of this algorithm for construction of the SPF of the best approximation of constants is proved. The analogy of criterions of the best approximation for real-valued functions on a segment by real-valued SPFs is proved. The analog of the Kolmogorov criterion of the best approximation for real-valued functions on a segment, Chebyshev's systems of functions, connected with SPFs, as well an alternance theorem and the theorem of Vallee-Poussin type are considered.