A simple, randomized algorithm for diagonalizing normal matrices
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Procedure for the Diagonalization of Normal Matrices
- A fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation
- An implementation of a divide and conquer algorithm for the unitary eigen problem
- Closest normal matrix finally found
- Convergence of the complex block Jacobi methods under the generalized serial pivot strategies
- Fast Approximate Joint Diagonalization Incorporating Weight Matrices
- Fast and stable unitary QR algorithm
- Jacobi Angles for Simultaneous Diagonalization
- LAPACK Users' Guide
- Matrix algorithms. Vol. 2: Eigensystems
- New Fast and Accurate Jacobi SVD Algorithm. I
- Numerical Methods for Simultaneous Diagonalization
- On the quadratic convergence of the Jabobi method for normal matrices
- Randomized Joint Diagonalization of Symmetric Matrices
- Sampling the eigenvalues of random orthogonal and unitary matrices
- Simultaneous diagonalization of nearly commuting Hermitian matrices: do-one-then-do-the-other
- Templates for the Solution of Algebraic Eigenvalue Problems
This page was built for publication: A simple, randomized algorithm for diagonalizing normal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939722)