POLYNOMIAL ROOT FINDING


			       M. Lang
     Department of Electrical and Computer Engineering - MS366
              Rice University, Houston, TX-77251

			    B.-C. Frenzel
	    Institut fuer Elektrische Maschinen, TU Berlin
	       Einsteinufer 11, D-10587 Berlin, Germany



			       ABSTRACT

Finding polynomial roots rapidly and accurately is an important
problem in many areas of signal processing. We present a program 
which is superior in speed and accuracy to the best methods to our
knowledge, i.e., Jenkins/Traub program and the eigenvalue method. 
Based on this we give a simple approach to improve the accuracy 
for spectral factorization in the case there are double roots on 
the unit circle.