The results of the Householder and QL algorithms for determining the eigenelements of a symmetric matrix, provided by a computer, always contain the errors resulting from floating-point arithmetic round-off error propagation. The Permutation-Perturbation method is a very efficient practical method
Computation of the Eigenelements of a matrix by the ϵ-algorithm
✍ Scribed by Claude Brezinski
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 653 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper derives the asymptotic second-order moments of the distinct eigenvalues and the corresponding eigenvectors of a sample covariance matrix in the correlated snapshot case. The general moment formulas obtained herein encompass several previously published results as special cases. The formul
An accurate and efficient algorithm, called fast inverse using nested dissection (FIND), for computing non-equilibrium Green's functions (NEGF) for nanoscale transistors has been developed and applied in the simulation of a novel dual-gate metal-oxide-semiconductor field-effect transistor (MOSFET) d