Polynomial root finding
- 1 October 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 1 (10) , 141-143
- https://doi.org/10.1109/97.329845
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
This publication has 7 references indexed in Scilit:
- Design of optimal minimum phase FIR filters by direct factorizationSignal Processing, 1986
- Finding the zeros of linear phase FIR frequency sampling digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Phase unwrapping by factorizationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A study of techniques for finding the zeros of linear phase FIR digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Matrix Eigensystem Routines — EISPACK GuideLecture Notes in Computer Science, 1976
- Algorithm 493: Zeros of a Real Polynomial [C2]ACM Transactions on Mathematical Software, 1975
- Principles for Testing Polynomial Zerofinding ProgramsACM Transactions on Mathematical Software, 1975