A minor subspace analysis algorithm
Fa-Long Luo, Rolf Unbehauen · IEEE Transactions on Neural Networks · 1997
This paper proposes a learning algorithm which extracts adaptively the minor subspace spanned by the eigenvectors corresponding to the smallest eigenvalues of the autocorrelation matrix of an input signal. We show both analytically and by simulation results that the weight vectors provided by the proposed algorithm are guaranteed to converge to the minor subspace of the input signal. For wider applications, we also present the complex valued version of the proposed minor subspace analysis algorithm.