A simple and efficient algorithm for eigenvalues computation - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

A simple and efficient algorithm for eigenvalues computation

Résumé

A simple algorithm for the computation of eigenvalues of real or complex square matrices is proposed. This algorithm is based on an additive decomposition of the matrix. A sufficient condition for convergence is proved. It is also shown that this method has many properties of the QR algorithm : it is invariant for the Hessenberg form, shifts are possible in the case of a null element on the diagonal. Some other interesting experimental properties are shown. Numerical experiments are given showing that most of the time the behavior of this method is not much different from that of the QR method, but sometimes it gives better results, particularly in the case of a bad conditioned real matrix having real eigenvalues.
Fichier principal
Vignette du fichier
Alt2007.pdf (152.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01334828 , version 1 (05-10-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

René Alt. A simple and efficient algorithm for eigenvalues computation. The 6th international conference on Numerical methods and applications, Aug 2007, Borovets, Bulgaria. pp.271-278, ⟨10.1007/978-3-540-70942-8_32⟩. ⟨hal-01334828⟩
47 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More