A note on continued fraction inversion by Routh's algorithm

This correspondence presents an algorithm for finding continued fraction inversion by Routh's algorithm. A recursive relation is given to implement the algorithm in a very simple way. This approach requires less computation when compared with the existing techniques. The method is demonstrated by means of a numerical example.