A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix

DOI10.1137/0906058zbMath0601.65024OpenAlexW2133694738MaRDI QIDQ3736807

G. W. Stewart

Publication date: 1985

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0906058

zbMATH Keywords

numerical experimentsSchur decompositionJacobi algorithmparallel iterative methodupper triangular form

Mathematics Subject Classification ID

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

Related Items

On pairs of almost diagonal matrices ⋮ Iterative refinement of Schur decompositions ⋮ A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix ⋮ Some complexity results in parallel matrix-based signal processing ⋮ On normal and structured matrices under unitary structure-preserving transformations ⋮ A sort-Jacobi algorithm for semisimple Lie algebras ⋮ A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD ⋮ Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems ⋮ Structured Eigenvalue Problems ⋮ A symplectic acceleration method for the solution of the algebraic Riccati equation on a parallel computer ⋮ An acceleration method for computing the generalized eigenvalue problem on a parallel computer ⋮ On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition ⋮ A quadratically convergent parallel Jacobi process for diagonally dominant matrices with distinct eigenvalues ⋮ A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil ⋮ A continuous Jacobi-like approach to the simultaneous reduction of real matrices ⋮ A triangular processor array for computing singular values