期刊文献+

新型自适应广义特征向量估计算法及其特性分析 被引量:1

Novel Adaptive Generalized Eigenvector Estimation Algorithm and Its Characteristic Analysis
下载PDF
导出
摘要 为了发展快速稳定的广义特征向量估计算法,该文提出基于神经网络的新型单维广义特征向量估计算法;通过分析该算法的所有平衡点证明了当且仅当神经网络权向量等于最小广义特征值对应的广义特征向量时该算法达到稳定状态;利用确定性离散时间分析方法完成了所提算法的动态特性分析,给出了保证算法收敛的边界条件;通过膨胀技术将单维算法扩展为多维广义特征向量估计算法,该算法可以根据实际需要增加提取广义特征向量的数量。仿真实验表明所提算法具有很好地收敛性,而且收敛速度优于一些现有算法。 In order to develop fast and stable algorithm for estimating generalized eigenvector,a novel neuronbased algorithm is proposed for extracting the single generalized eigenvector.Through analyzing all of the stationary points,it is proved that the single estimation algorithm reaches the steady state if and only if the weight vector of the neural network is equal to the generalized eigenvector corresponding to the smallest generalized eigenvalue of a matrix pencil.The dynamic analysis of the single estimation algorithm is accomplished by the deterministic discrete time method and some boundary conditions are also obtained to guarantee the algorithm’s convergence.Trough applying the inflation technique,the single generalized eigenvector estimation algorithm is extended into a multiple generalized eigenvector estimation algorithm,and the number of the generalized eigenvectors can be increased according to actual requirement.Simulation experiments results prove that the proposed algorithm has good convergence,and the convergence speed is better than some existing algorithms.
作者 徐中英 高迎彬 孔祥玉 XU Zhongying;GAO Yingbin;KONG Xiangyu(College of Missile Engineering,The Rocket Force University of Engineering,Xi’an 710025,China;The 54th Research Institute of China Electronics Technology Group Corporation,Shijiazhuang 050081,China)
出处 《电子与信息学报》 EI CSCD 北大核心 2022年第1期254-260,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(62106242,62101579,61903375) 陕西省自然科学基金(2020JM-356)。
关键词 广义特征向量 稳定性分析 动态特性分析 多维提取 Generalized eigenvector Stability analysis Dynamic analysis Multiple extraction
  • 相关文献

参考文献1

二级参考文献19

  • 1ZHAO X W, YANG Q S, and ZHANG Y H. Compressed sensing approach for pattern synthesis of maximally sparse non-uniform linear array[J]. IET Microwaves, Antennas Propagation, 2014, 8(5): 301-307.
  • 2WANG X R, ABOUTANIOS E, and AMIN M G. Thinned array beampattern synthesis by iterative soft-threshold-based optimization algorithms[J]. IEEE Transactions on Antennas and Propagation, 2014, 62(12): 6102-6113.
  • 3SARTORI D, MANICA L, OLIVERI G, et al. Design of thinned arrays with controlled sidelobes by ADS-CP strategy [C]. 8th European Conference on Antennas and Propagation (EuCAP2014), Hague, Netherlands, 2014: 1-17.
  • 4PINCHERA D and MIGLIORE M D. Effective sparse array synthesis using a generalized alternate projection algorithm [C]. IEEE Conference on Antenna Measurements &: Applications, Antibes, France, 2014: 16:19.
  • 5ANGELETTI P, TOSO G, and RUGGERINI G. Sparse array antennas with optimized elements positions and dimensions[C]. 8th European Conference on Antennas and Propagation (EuCAP2014), Hague, Netherlands, 2014: 3142-3145.
  • 6OLIVERI G and MASSA A. Bayesian compressive sampling for pattern synthesis with maximally sparse non-uniform linear arrays[J]. IEEE Transactions on Antennas and Propagation, 2011, 59(2): 467-481.
  • 7OLIVERI G, CARLIN M, and MASSA A. Complex-weight sparse linear array synthesis by Bayesian compressive sampling[J]. IEEE Transactions on Antennas and Propagation, 2012, 60(5): 2309-2326.
  • 8LIU Y H, NIE Z P, and LIU Q H. Reducing the number of elements in a linear antenna array by the matrix pencil method[J]. IEEE Transactions on Antennas and Propagation, 2008, 56(9): 2955-2962.
  • 9LIU Y H, LIU Q H, and NIE Z P. Reducing the number of elements in the synthesis of shaped-beam patterns by the forward-backward matrix pencil method[J]. IEEE Transactions on Antennas and Propagation, 2010, 58(2): 604-608.
  • 10LEE A. Centrohermitian and skewcentrohermitian matrices [J]. Linear Algebra and Its Application, 1980, 29: 205-210.

共引文献3

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部