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.
关键词
Keywords
references
Valizadeh A,Karimi M.Fast subspace tracking algorithm based on the constrained projection approximation[J].Eurasip Journal on Advances in Signal Processing,2009:1-16.
Golub G H,Van Loan C F.Matrix computations[M].3rd ed.Baltimore:The Johns Hopkins Univ.Press,1996.
Comon P,Golub G H.Tracking a few extreme singular values and vectors in signal processing[J].Proceedings of the IEEE,1990,78(8):1327-1343.
Yang B.Projection approximation subspace tracking[J].IEEE Trans Signal Processing,1995,43(1):95-107.