Polynomial root finding

Abstract

Finding polynomial roots rapidly and accurately is an important problem in many areas of signal processing. We present a program that is superior in speed and accuracy to the best methods to our knowledge, i.e., Jenkins/Traub (1975) program and the eigenvalue method. Based on this, we give a simple approach to improve the accuracy for spectral factorization in the case that there are double roots on the unit circle.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>