An Amendment of Fast Subspace Tracking Methods
Numerical Analysis
2012-02-28 v3 Neural and Evolutionary Computing
Abstract
Tuning stepsize between convergence rate and steady state error level or stability is a problem in some subspace tracking schemes. Methods in DPM and OJA class may show sparks in their steady state error sometimes, even with a rather small stepsize. By a study on the schemes' updating formula, it is found that the update only happens in a specific plane but not all the subspace basis. Through an analysis on relationship between the vectors in that plane, an amendment as needed is made on the algorithm routine to fix the problem by constricting the stepsize at every update step. The simulation confirms elimination of the sparks.
Keywords
Cite
@article{arxiv.1201.0041,
title = {An Amendment of Fast Subspace Tracking Methods},
author = {Zhu Cheng and Zhan Wang and Haitao Liu and Majid Ahmadi},
journal= {arXiv preprint arXiv:1201.0041},
year = {2012}
}
Comments
4 pages, 3 figures