Iterative Methods for Computing Eigenvalues and Eigenvectors
arXiv:1105.1185
Abstract
We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The derivations, procedure, and advantages of each method are briefly discussed.
9 pages
Cited by in corpus (6)
- Implementation of the Principal Component Analysis onto High-Performance Computer Facilities for Hyperspectral Dimensionality Reduction: Results and Comparisons
- Do Not Let Privacy Overbill Utility: Gradient Embedding Perturbation for Private Learning
- Filtered Inner Product Projection for Crosslingual Embedding Alignment
- UFO-BLO: Unbiased First-Order Bilevel Optimization
- A Converse to Banach's Fixed Point Theorem and its CLS Completeness
- A Memristor-Based Optimization Framework for AI Applications