On the quadratic convergence of the Jabobi method for normal matrices
From MaRDI portal
Publication:5542533
Cites work
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- A Procedure for the Diagonalization of Normal Matrices
- Almost diagonal matrices with multiple or close eigenvalues
- Note on the quadratic convergence of the cyclic Jacobi process
- On the quadratic convergence of the special cyclic Jacobi method
Cited in
(14)- Relative eigenvalue and singular value perturbations of scaled diagonally dominant matrices
- On Kogbetliantz's SVD algorithm in the presence of clusters
- Closest normal matrix finally found
- Computational methods of linear algebra
- On sharp quadratic convergence bounds for the serial Jacobi methods
- Convergence of scaled iterates by the Jacobi method
- On quadratic convergence bounds for the \(J\)-symmetric Jacobi method
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- On the eigenproblem for normal matrices
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matrices
- Minimization of the Frobenius norm of a complex matrix using planar similarities
- Minimizing the Euclidean norm of a complex matrix by plane similarities
- A simple, randomized algorithm for diagonalizing normal matrices
This page was built for publication: On the quadratic convergence of the Jabobi method for normal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5542533)