Abstract
A dynamical system for computing the largest eigenpair of a given positive matrix is introduced. Certain qualitative properties of the proposed system are analyzed in detail. Our results suggest that the weight-bounding term in PCA algorithms for extracting the first principal component could assume a class of forms. © 1995, IEEE. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 790-791 |
| Journal | IEEE Transactions on Neural Networks |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - May 1995 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Dynamical System for Computing the Eigenvectors Associated with the Largest Eigenvalue of a Positive Definite Matrix'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver