期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Computationally efficient direction finding using polynomial rooting with reduced-order and real-valued computations 被引量:3
1
作者 Fenggang Yan Yi Shen +1 位作者 Ming Jin Xiaolin Qiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第4期739-745,共7页
The root multiple signal classification(root-MUSIC) algorithm is one of the most important techniques for direction of arrival(DOA) estimation. Using a uniform linear array(ULA) composed of M sensors, this metho... The root multiple signal classification(root-MUSIC) algorithm is one of the most important techniques for direction of arrival(DOA) estimation. Using a uniform linear array(ULA) composed of M sensors, this method usually estimates L signal DOAs by finding roots that lie closest to the unit circle of a(2M-1)-order polynomial, where L 〈 M. A novel efficient root-MUSIC-based method for direction estimation is presented, in which the order of polynomial is efficiently reduced to 2L. Compared with the unitary root-MUSIC(U-root-MUSIC) approach which involves real-valued computations only in the subspace decomposition stage, both tasks of subspace decomposition and polynomial rooting are implemented with real-valued computations in the new technique,which hence shows a significant efficiency advantage over most state-of-the-art techniques. Numerical simulations are conducted to verify the correctness and efficiency of the new estimator. 展开更多
关键词 direction-of-arrival(DOA) estimation root multiple signal classification(root-MUSIC) real-valued computations reduced-order
下载PDF
High-Order Iterative Methods Repeating Roots a Constructive Recapitulation
2
作者 Isaac Fried 《Applied Mathematics》 2022年第2期131-146,共16页
This paper considers practical, high-order methods for the iterative location of the roots of nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable to multiple roots of init... This paper considers practical, high-order methods for the iterative location of the roots of nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable to multiple roots of initially known and unknown multiplicity. Efficient methods are presented in this note for the evaluation of the multiplicity index of the root being sought. Also reviewed here are super-linear and super-cubic methods that converge contrarily or alternatingly, enabling us, not only to approach the root briskly and confidently but also to actually bound and bracket it as we progress. 展开更多
关键词 roots of Nonlinear Equations Multiple roots Multiplicity Index of a root estimation of the Multiplicity Index of a root High-Order Iterative Methods root Bracketing Alternatingly Converging Methods Contrarily Converging Methods
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部