頁籤選單縮合
題名 | Rayleigh Quotient Iterative Algorithms for Frequency Estimation and Direction Finding |
---|---|
作者姓名(中文) | 何志誠; 楊家輝; | 書刊名 | Journal of Information Science and Engineering |
卷期 | 8:2 1992.06[民81.06] |
頁次 | 頁305-320 |
分類號 | 310.15 |
關鍵詞 | Parallel computation; Nonstationary roots; Computation complexity; Deflation; Principal roots; Random initializations; |
語文 | 英文(English) |
英文摘要 | The Rayleigh quotient iterative algorithm with computational complexity O(N ) was originally suggested for finding the eigenvalues of an N-by-N matrix with fast convergence rate. In this paper, a modified payleigh quotient iterative (MRQI) algorithm is proposed to track the desired roots, i.e. the roots close to the unit circle of spectral polynomials. The MRQI algorithm associated with a zero suppression technique, called the parallel Rayleigh Quotient iterative (PRQI) algotithm, is further proposed to assure that rooting processors converge to different desired principal roots of spectral polynomials. The PROI alglrithm only with computational complexity O(N) tracks the nonstationary roots of spectral polynomials even starting from random initializations. Simulations show the better tracking performance of the suggested algorithm compared to that of the gradient Newton algorithm[11]. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。