Applications of Routh's Algorithm to Network-Theory Problems

The well-known Routh's criterion uses a very efficient computational method, or algorithm, that has been found to reduce greatly calculational labor and chances of error in a number of other important applications to circuit theory. Among these applications are finding common factors of polynomials, computing Sturm's functions, synthesizing RC, RL, or LC ladder networks by means of continued-fraction expansions, determining RC, RL, or LC realizability of a given immittance function, and analysis of ladder networks. Methods of handling the first two problems, both in normal and special cases, are given and illustrated.