Adaptive algorithms for tracking roots of spectral polynomials

Jar-Ferr Yang, M. Kaveh

研究成果: Conference article同行評審

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)1162-1165
頁數4
期刊ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
2
出版狀態Published - 1989 12月 1
事件1989 International Conference on Acoustics, Speech, and Signal Processing - Glasgow, Scotland
持續時間: 1989 5月 231989 5月 26

All Science Journal Classification (ASJC) codes

  • 軟體
  • 訊號處理
  • 電氣與電子工程

指紋

深入研究「Adaptive algorithms for tracking roots of spectral polynomials」主題。共同形成了獨特的指紋。

引用此