𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized rank annihilation method. I: Derivation of eigenvalue problems

✍ Scribed by N. M. Faber; L. M. C. Buydens; G. Kateman


Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
534 KB
Volume
8
Category
Article
ISSN
0886-9383

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Davidson method for eigenpairs and their
✍ Xie, Huiqing ;Dai, Hua πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

Based on Davidson method for solving generalized eigenvalue problems, a new method for synchro calculation of eigenpairs and their partial derivatives of generalized eigenvalue problems is presented. Eigenpairs and their partial derivatives are computed simultaneously. The equation systems that are

Generalized rank annihilation method: st
✍ Klaas Faber; Avraham Lorber; Bruce R. Kowalski πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 2 views

The generalized rank annihilation method (GRAM) is a method for curve resolution and calibration that uses two data matrices simultaneously, i.e. one for the unknown and one for the calibration sample. The method is known to become an eigenvalue problem for which the eigenvalues are the ratios of th

New Methods for Calculations of the Lowe
✍ Alexander V. Mitin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 71 KB

A new iterative method based on a Newton correction vector for extension of the Krylov subspace, its diagonal, and band versions are proposed for calculation of selected lowest eigenvalues and corresponding eigenvectors of the generalized symmetric eigenvalue problem. Additionally, diagonal and band