A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
Steven Huss‐Lederman, Anna Tsao, Thomas Turnbull · SIAM Journal on Scientific Computing · 1997
In this paper, preliminary research results on a new algorithm for finding all the eigenvalues and eigenvectors of a real diagonalizable matrix with real eigenvalues are presented. The basic mathematical theory behind this approach is reviewed and is followed by a discussion of the numerical considerations of the actual implementation. The numerical algorithm has been tested on thousands of matrices on both a Cray-2 and an IBM RS/6000 Model 580 workstation. The results of these tests are presented. Finally, issues concerning the parallel implementation of the algorithm are discussed. The algorithm's heavy reliance on matrix--matrix multiplication, coupled with the divide and conquer nature of this algorithm, should yield a highly parallelizable algorithm.
Cited by 17 works. doi:10.1137/s1064827592228833
Authors
References
- Linear Algebra
- LINPACK User's Guide.
- LAPACK: A Portable Linear Algebra Library for High-Performance Computers
- Rank degeneracy and least squares problems
- A divide and conquer method for the symmetric tridiagonal eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Jacobi’s Method is More Accurate than QR
- The matrix sign function and computations in systems
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- Rational Iterative Methods for the Matrix Sign Function