Efficent computation of eigenvalues of randomly generated matrices
From MaRDI portal
Publication:1805261
DOI10.1016/0096-3003(94)90155-4zbMath0828.65037OpenAlexW2042846938MaRDI QIDQ1805261
Publication date: 10 January 1996
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(94)90155-4
eigenvaluesnumerical experimentsparallelization\(LR\) iterationbanded Hessenberg formRayleigh coefficient iteration
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The nonsymmetric Lanczos algorithm and controllability
- On the Bounds of a One-Parametric Family of Matrices.
- Reduction to Tridiagonal Form and Minimal Realizations
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- Algorithm 696
- Reduction of a General Matrix to Tridiagonal Form
This page was built for publication: Efficent computation of eigenvalues of randomly generated matrices