Adaptive estimation of eigensubspace

Mathew, G. ; Reddy, V. U. ; Dasgupta, S. (1995) Adaptive estimation of eigensubspace IEEE Transactions on Signal Processing, 43 (2). 401 - 411. ISSN 1053-587X

Full text not available from this repository.

Official URL:

Related URL:


In a recent work we recast the problem of estimating the minimum eigenvector (eigenvector corresponding to the minimum eigenvalue) of a symmetric positive definite matrix into a neural network framework. We now extend this work using an inflation technique to estimate all or some of the orthogonal eigenvectors of the given matrix. Based on these results, we form a cost function for the finite data case and derive a Newton-based adaptive algorithm. The inflation technique leads to a highly modular and parallel structure for implementation. The computational requirement of the algorithm is O(N2), N being the size of the covariance matrix. We also present a rigorous convergence analysis of this adaptive algorithm. The algorithm is locally convergent and the undesired stationary points are unstable. Computer simulation results are provided to compare its performance with that of two adaptive subspace estimation methods proposed by Yang and Kaveh (1988) and an improved version of one of them, for stationary and nonstationary signal scenarios. The results show that the proposed approach performs identically to one of them and is significantly superior to the remaining two.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:45197
Deposited On:25 Jun 2011 09:39
Last Modified:25 Jun 2011 09:39

Repository Staff Only: item control page