Abstract:
Study of Padé–Faber approximation (generalizations of the Padé approximation and the Padé–Chebyshev approximation) of Markov functions are important not only from the point of view of mathematical analysis, but also of computational mathematics. The theorem on the existence of subdiagonal approximants is constructively proved. Various estimates of the approximation error are given. Theoretical assertions are illustrated by simulation results.