High-order polynomial root tracking algorithm

David Starer, Arye Nehorai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

A new, efficient algorithm for tracking the roots of time-varying polynomials with complex coefficients is presented. The algorithm updates a vector of polynomial roots in response to a perturbation in polynomial coefficients. The update requires only the solution of a single set of linear equations. The algorithm has been used successfully to track the roots of high-order polynomials. The accuracy of the algorithm can be improved by iteration. When operated iteratively, it converges rapidly, and usually requires less than ten iterations to reach the maximum accuracy achievable using sixteen significant digital arithmetic.

Original languageEnglish
Title of host publicationICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages465-468
Number of pages4
ISBN (Electronic)0780305329
DOIs
StatePublished - 1992
Event1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco, United States
Duration: Mar 23 1992Mar 26 1992

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume4
ISSN (Print)1520-6149

Conference

Conference1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992
Country/TerritoryUnited States
CitySan Francisco
Period03/23/9203/26/92

Fingerprint

Dive into the research topics of 'High-order polynomial root tracking algorithm'. Together they form a unique fingerprint.

Cite this