• search hit 14 of 26
Back to Result List

On asymptotic convergence of nonsymmetric Jacobi algorithms

Please always quote using this URN:urn:nbn:de:0296-matheon-3979
  • The asymptotic convergence behavior of cyclic versions of the nonsymmetric Jacobi algorithm for the computation of the Schur form of a general complex matrix is investigated. Similar to the symmetric case, the nonsymmetric Jacobi algorithm proceeds by applying a sequence of rotations that annihilate a pivot element in the strict lower triangular part of the matrix until convergence to the Schur form of the matrix is achieved. In this paper, it is shown that the cyclic nonsymmetric Jacobi method converges locally and asymptotically quadratically under mild hypotheses if special ordering schemes are chosen, namely ordering schemes that lead to so-called northeast directed sweeps. The theory is illustrated by the help of numerical experiments. In particular, it is shown that there are ordering schemes that lead to asymptotic quadratic convergence for the cyclic symmetric Jacobi method, but only to asymptotic linear convergence for the cyclic nonsymmetric Jacobi method. Finally, a generalization of the nonsymmetric Jacobi method to the computation of the Hamiltonian Schur form for Hamiltonian matrices is introduced and investigated.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Christian Mehl
URN:urn:nbn:de:0296-matheon-3979
Referee:Volker Mehrmann
Document Type:Preprint, Research Center Matheon
Language:English
Date of first Publication:2007/06/19
Release Date:2007/06/19
Institute:Technische Universität Berlin
Preprint Number:393
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.