A continued fraction algorithm

Summary Two existing algorithms for the evaluation of a finite sequence of convergents of a continued fraction are considered. Each method has a drawback concerning numerical stability or computational effort. A third algorithm is presented which requires less computations than the first method, and generally is more stable than the second one. The results are illustrated by numerical examples. The connection with Mikloko's algorithm is shown.