✦ LIBER ✦

Adaptive algorithms for first principal eigenvector computation

✍ Scribed by Chanchal Chatterjee

Book ID: 104065304
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 243 KB
Volume: 18
Category: Article
ISSN: 0893-6080
DOI: 10.1016/j.neunet.2004.11.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Adaptive Extraction Algorithm for M

Fast Adaptive Extraction Algorithm for Multiple Principal Generalized Eigenvectors

✍ Yang, Jian; Chen, Xi; Xi, Hongsheng 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 648 KB

Adaptive Computation Algorithm for RBF N

Adaptive Computation Algorithm for RBF Neural Network

✍ Hong-Gui Han; Jun-Fei Qiao 📂 Article 📅 2012 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 371 KB

The Power Method for Computing the Large

The Power Method for Computing the Largest Eigenvectors (Principal Components) of a Dispersion Matrix Using Minimal Computer Memory

✍ Conor V. Dolan; Peter C.M. Molenaar 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 486 KB

Two adaptive Gauss-Legendre type algorit

Two adaptive Gauss-Legendre type algorithms for the verified computation of definite integrals

✍ W. Krämer; S. Wedner 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 748 KB

Automatic parameter selection for a k-se

Automatic parameter selection for a k-segments algorithm for computing principal curves

✍ Haonan Wang; Thomas C.M. Lee 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Linear combination of Lanczos vectors: A

Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations

✍ T. Koslowski; W. Von Niessen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i