A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396)

A chained-matrices approach for parallel computing the \(n\)th convergent of continued fractions is presented here. The algorithm developed computes the entire prefix values of any continued fraction in \(O(\log n)\) time on the EREW PRAM model or a network with \(O(n/\log n)\) processors connected by the cube connected cycles etc. The algorithm is applied to approximate \(\pi\) and \(e\) in \(O(\log m)\) time by using \(O(m/ \log m)\) processors for a result with \(m\) digit precision. Cost optimal solutions of a number of related problems are also given here.