Abstract:
A generalization of the Jacobi–Perron algorithm to the case of functions is considered. The rate is determined for the convergence (with respect to the coefficients of the Laurent series) of the generating rational functions to the functions that are being expanded in a continued fraction by means of this algorithm. A necessary and sufficient condition is given for a continued fraction to be broken off.
Bibliography: 8 titles.