By Topic

Adaptive algorithms for tracking roots of spectral polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. F. Yang ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; M. Kaveh

The authors propose two fast adaptive algorithms, namely Newton's gradient algorithm and the modified Rayleigh-quotient adaptive algorithm. These methods work in association with adaptive eigensubspace algorithms for tracking the zeros of a nonstationary spectrum polynomial. Newton's gradient algorithm is developed under a linearly constrained minimization procedure, whereas the modified Rayleigh-quotient adaptive technique is derived from the Rayleigh-quotient calculating procedure for the eigenstructure of the companion matrix of the spectrum polynomial. For an Nth-order polynomial, the adaptive algorithm has requires computational complexity O(N). The adaptive algorithms operate independently for each zero and have better tracking and computational complexity than the direct rooting method or the zero-sensitive adaptive algorithm

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989