Computing the eigenvectors of nonsymmetric tridiagonal matrices

Laudadio, Teresa;Mastronardi, Nicola;Van Dooren, Paul
(2020) Computational Mathematics and Mathematical Physics — Vol. 61, p. p. 733-749 (2021)

Files

LaudadioMV20.pdf
  • Open Access
  • Adobe PDF
  • 404.02 KB
Download

Details

Authors
  • Laudadio, TeresaIstituto per le Applicazioni del Calcolo, CNR, Italy
    Author
  • Mastronardi, NicolaUCLouvain
    Author
  • Van Dooren, PaulUCLouvain
    Author
Abstract
The computation of the eigenvalue decomposition of matrices is one of the most investigated problems in numerical linear algebra. In particular, real nonsymmetric tridiagonal eigenvalue problems arise in a variety of applications. In this paper the problem of computing an eigenvector corresponding to a known eigenvalue of a real nonsymmetric tridiagonal matrix is considered, developing an algorithm that combines part of a QR sweep and part of a QL sweep, both with the shift equal to the known eigenvalue. The numerical tests show the reliability of the proposed method
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Laudadio, T., Mastronardi, N., & Van Dooren, P. (2020). Computing the eigenvectors of nonsymmetric tridiagonal matrices. Computational Mathematics and Mathematical Physics, 61, p. 733-749. https://hdl.handle.net/2078.5/254753 (Original work published 2021)