Abstract
A new sequential O(n/sup 2/) polynomial factorization algorithm that updates all roots of an nth-order polynomial with real time-varying coefficients simultaneously and efficiently in response to coefficient perturbations is introduced. The algorithm is based on a variant of sequential orthogonal iteration and exploits the special structure of the coefficient companion matrix. All internal operations are based on real passive Givens plane rotations and real matrix-vector multiplications. The algorithm is unconditionally stable and requires no initial guess of the root values. Numerical examples are presented to demonstrate the performance of the algorithm. Comparisons are made to the Starer and Nehorai (1991) root tracking algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
