Sturm test algorithm for digital computer

Sturm´s theorem finds much use in linear passive network synthesis. It forms a concluding part of the test for positive real functions, to determine the existence of any positive roots and their multiplicity. By applying the Sturm´s theorem to a polynomial, its multiple roots are placed in evidence. The character and multiplicity of roots. of the polynomial under test is determined by inspection or by a simple test, or, if necessary, by repeated use of Sturm´s test itself. While dealing with highorder polynomials, repeated use of Sturm´s test is necessary, and a computer desirable, since Sturm´s test becomes very complex. For a digital computer, the process should be based on a suitable algorithm capable of handling a general case. In this paper, an attempt has been made to present such an algorithm. A flow chart has been developed for this algorithm, process computerized and program tested on a digital computer.