Boundedness conditions and the direct analysis of computation errors of a recurrent relation

In this paper the recurrent relation generating the chain fraction is considered. We find different non-weakened sufficient conditions of its boundedness and small growth of computation errors, caused by the inaccuracy of arithmetical operations implementation. These conditions as well as error estimates do not contain any indefinite constants and are expressed in the form of exact inequalities through machine ε.