论文信息 - An Intrinsic CG Algorithm for Computing Dominant Subspaces

An Intrinsic CG Algorithm for Computing Dominant Subspaces

In this paper, a conjugate gradient method on the complex Grabmann manifold is proposed that computes the k-principal components of a Hermitian (n × n)-matrix. The algorithm is at most of order O(n2k) and yields locally good convergence results.

Knut Hüper | Martin Kleinsteuber

[1] Gene H. Golub,et al. Matrix computations , 1983 .

[2] Hong Wang,et al. Coherent signal-subspace processing for the detection and estimation of angles of arrival of multiple wide-band sources , 1985, IEEE Trans. Acoust. Speech Signal Process..

[3] Tapan K. Sarkar,et al. A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix , 1989, IEEE Trans. Acoust. Speech Signal Process..

[4] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..

[5] Richard M. Everson,et al. Inferring the eigenvalues of covariance matrices from limited, noisy data , 2000, IEEE Trans. Signal Process..

[6] D. Gabay. Minimizing a differentiable function over a differential manifold , 1982 .

[7] J. Stoer. On the relation between quadratic termination and convergence properties of minimization algorithms , 1977 .

[8] U. Helmke,et al. Optimization and Dynamical Systems , 1994, Proceedings of the IEEE.

[9] Golub Gene H. Et.Al. Matrix Computations, 3rd Edition , 2007 .