NobleBlocks

Research indexJournal article

High-order polynomial root tracking algorithm

Starer, Nehorai

1 Jan 1992

NobleIDark:/48914/w1/20260525/EBC8A17BDOI10.1109/icassp.1992.226335

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

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.< &gt;

Discussion

Citations

Topics

More

Suggest a correction or report