By Topic

Real-time computation of the eigenvector corresponding to the smallest eigenvalue of a positive definite matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Luo Fa-Long ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Li Yan-Da

In the real-time applications of many signal processing algorithms, such as the TLS (Total Least Squares) algorithm, it is desired to compute as fast as possible the eigenvector corresponding to the smallest eigenvalue of a positive definite matrix. This paper proposes an analog circuit approach to computing in real-time the desired eigenvector. We show analytically and by simulations that the proposed circuit is guaranteed to be stable and to provide the results arbitrarily close to the accurate eigenvector within an elapsed time of only a few characteristic time constants of the circuit.

Published in:

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications  (Volume:41 ,  Issue: 8 )