快速单边补偿逼近幂迭代子空间跟踪  

Fast Single Compensation Approximated Power Iteration Subspace Tracking Algorithm

作　　者：魏志强[1] 鲁慧丽[2] 

机构地区：[1]华北水利水电学院数学与信息科学学院,河南郑州450011 [2]南京邮电大学计算机学院,江苏南京210046

出　　处：《中北大学学报（自然科学版）》2012年第4期381-386,共6页Journal of North University of China(Natural Science Edition)

基　　金：国家自然科学基金项目(11101145);河南省基础与前沿技术研究计划项目(102300410129)

摘　　要：针对子空间估计与跟踪问题,在快速逼近幂迭代子空间跟踪算法的基础上,得到了一种计算复杂度更低的快速子空间跟踪算法——快速单边补偿逼近幂迭代子空间跟踪算法.该算法采用与Badeau等人不同的逼近方式,简化了互相关矩阵的迭代计算,从而达到降低计算复杂度的目的.实验结果表明:该算法的最大主角性能远远优于PAST子空间跟踪算法,与FAPI和OPAST子空间跟踪算法相当;在正交误差度方面,其正交误差度优于FAPI子空间跟踪算法,远远优于PAST子空间跟踪算法.For the subspace estimating and tracking, based on the well-known fast approximated power iteration （FAPI） subspace tracking algorithm, a new fast subspace tracking algorithm with lower computational complexity was proposed, that is fast single compensation approximated power iteration （FSCAPI） subspace tracking algorithm. The algorithm used different approximations with Badeau et al, simplifying the iterative calculation of the correlation matrix, so as to achieve the purpose to reduce the computational complexity. The experimental results show that the maximum principal angle performance of the algorithm is far superior to the PAST subspace tracking algorithm and performances fairly the same with FAPI and OPAST subspace tracking algorithms; the deviation from orthonormality of the algorithm is better than the FAPI subspace tracking algorithm and far better than the PAST subspace tracking algorithm.

关 键 词：子空间跟踪 逼近幂迭代 快速算法 

分 类 号：O29[理学—应用数学]