Numerical Methods for Simultaneous Diagonalization
Angelika Bunse‐Gerstner, Ralph Byers, Volker Mehrmann · SIAM Journal on Matrix Analysis and Applications · 1993
A Jacobi-like algorithm for simultaneous diagonalization of commuting pairs of complex normal matrices by unitary similarity transformations is presented. The algorithm uses a sequence of similarity transformations by elementary complex rotations to drive the off-diagonal entries to zero. Its asymptotic convergence rate is shown to be quadratic and numerically stable. It preserves the special structure of real matrices, quaternion matrices, and real symmetric matrices.
Cited by 180 works. doi:10.1137/0614062
Authors
References
- The algebraic eigenvalue problem
- Matrix Eigensystem Routines — EISPACK Guide
- The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
- Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen*).
- The Symmetric Eigenvalue Problem
- Applied Linear Algebra
- Symmetry Principles in Solid State and Molecular Physics
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- Real and Complex Analysis
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays