On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms

DOI10.1137/060663246zbMath1165.65015OpenAlexW2007387334MaRDI QIDQ3609026

Christian Mehl

Publication date: 6 March 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7c1f16b304e250083d3da98ea1333d194d245208

zbMATH Keywords

asymptotic convergenceSchur formHamiltonian Schur formHamiltonian Jacobi algorithmnonsymmetric Jacobi algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (8)

Some remarks on the complex \(J\)-symmetric eigenproblem ⋮ Finding the closest normal structured matrix ⋮ Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation ⋮ Iterative refinement of Schur decompositions ⋮ Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem ⋮ Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form ⋮ Nearest \(\Omega \)-stable matrix via Riemannian optimization ⋮ Implicit QR algorithms for palindromic and even eigenvalue problems

Uses Software

• Matlab

This page was built for publication: On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms