Convergence of LR algorithm for a one-point spectrum tridiagonal matrix

DOI10.1007/s00211-009-0238-2zbMath1176.65040OpenAlexW2069182935MaRDI QIDQ841128

Carla Ferreira, Beresford N. Parlett

Publication date: 14 September 2009

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-009-0238-2

zbMATH Keywords

convergenceeigenvalueseigenvectorLR algorithmJordan blockunreduced tridiagonal matrix, Jordan form

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix ⋮ A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of tridiagonal QR algorithm with origin shifts
• The LR transformation method for symmetric matrices
• The calculation of Lame polynomials
• Canonical Decomposition of Hessenberg Matrices
• Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
• The Development and Use of Methods of LR Type

This page was built for publication: Convergence of LR algorithm for a one-point spectrum tridiagonal matrix