A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
G. W. Stewart · SIAM Journal on Scientific and Statistical Computing · 1985
This paper describes an iterative method for reducing a general matrix to upper triangular form by unitary similarity transformations. The method is similar to Jacobi’s method for the symmetric eigenvalue problem in that it uses plane rotations to annihilate off-diagonal elements, and when the matrix is Hermitian it reduces to a variant of Jacobi’s method. Although the method cannot compete with the QR algorithm in serial implementation, it admits of a parallel implementation in which a double sweep of the matrix can be done in time proportional to the order of the matrix.
Cited by 101 works. doi:10.1137/0906058
Authors
References
- The algebraic eigenvalue problem
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- The Jacobi method for real symmetric matrices
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian Matrices
- Data-flow algorithms for parallel matrix computation
- A Systolic Architecture for Almost Linear-Time Solution of the Symmetric Eigenvalue Problem
- On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matrices