DocumentCode :
1191075
Title :
Polynomial root finding
Author :
Lang, Markus ; Frenzel, Bernhard-Christian
Author_Institution :
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
Volume :
1
Issue :
10
fYear :
1994
Firstpage :
141
Lastpage :
143
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.<>
Keywords :
polynomials; signal processing; spectral analysis; double roots; polynomial root finding; signal processing; spectral factorization; unit circle; Convergence; Eigenvalues and eigenfunctions; Filters; Phase estimation; Polynomials; Signal design; Signal processing; Signal processing algorithms; Testing;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/97.329845
Filename :
329845
Link To Document :
بازگشت