On numerical stability of continued fractions

The paper considers the numerical stability of the backward recurrence algorithm (BR-algorithm) for computing approximants of the continued fraction with complex elements. The new method establishes sufficient conditions for the numerical stability of this algorithm and the error bounds of the calculation of the $n$th approximant of the continued fraction with complex elements. It follows from the obtained conditions that the numerical stability of the algorithm depends not only on the rounding errors of the elements and errors of machine operations but also on the value sets and the element sets of the continued fraction. The obtained results were used to study the numerical stability of the BR-algorithm for computing the approximants of the continued fraction expansion of the ratio of Horn's confluent functions $\mathrm{H}_7$. Bidisc and bicardioid regions are established, which guarantee the numerical stability of the BR-algorithm. The obtained result is applied to the study of the numerical stability of computing approximants of the continued fraction expansion of the ratio of Horn's confluent function $\mathrm{H}_7$ with complex parameters. In addition, the analysis of the relative errors arising from the computation of approximants using the backward recurrence algorithm, the forward recurrence algorithm, and Lenz's algorithm is given. The method for studying the numerical stability of the BR-algorithm proposed in the paper can be used to study the numerical stability of the branched continued fraction expansions and numerical branched continued fractions with elements in angular and parabolic domains.