A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices

Details A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices

2011-06-08

arxiv.org/abs/1106.1497v1

Mathematics

Probability

Scientific paper

This paper deals with the problem of parameter estimation based on certain eigenspaces of the empirical covariance matrix of an observed multidimensional time series, in the case where the time series dimension and the observation window grow to infinity at the same pace. In the area of large random matrix theory, recent contributions studied the behavior of the extreme eigenvalues of a random matrix and their associated eigenspaces when this matrix is subject to a fixed-rank perturbation. The present work is concerned with the situation where the parameters to be estimated determine the eigenspace structure of a certain fixed-rank perturbation of the empirical covariance matrix. An estimation algorithm in the spirit of the well-known MUSIC algorithm for parameter estimation is developed. It relies on an approach recently developed by Benaych-Georges and Nadakuditi, relating the eigenspaces of extreme eigenvalues of the empirical covariance matrix with eigenspaces of the perturbation matrix. First and second order analyses of the new algorithm are performed.

Affiliated with

Also associated with

No associations

Rating

A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319903