A new look on the parallel implementation of the Shur algorithm for the solution of Toeplitz equations

The Shür algorithm is considered in this paper and two different computational organizations are studied. The first is equivalent to the well known "parallel" solution of the Toeplitz equations, the second gives an order recursive algorithm. A simple demonstration of the Shür recursion is outlined and a "superlattice" structure is given for the imple - mentation of both types of algorithms.