Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix

DOI10.1007/s00211-012-0470-zzbMath1332.65050OpenAlexW2076471477MaRDI QIDQ1938434

Carla Ferreira, Froilán M. Dopico, Beresford N. Parlett

Publication date: 4 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00211-012-0470-z

Mathematics Subject Classification ID

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

Related Items

Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices ⋮ Structured eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Computing the eigenvectors of nonsymmetric tridiagonal matrices ⋮ The Inverse Eigenvector Problem for Real Tridiagonal Matrices ⋮ A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of LR algorithm for a one-point spectrum tridiagonal matrix
• Spectral sensitivity of products of bidiagonals
• Relative perturbation theory. III: More bounds on eigenvalue variation
• Accurate computation of the zeros of the generalized Bessel polynomials
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Eigenvalue condition numbers: zero-structured versus traditional.
• On the Use of Stability Regions in the Numerical Analysis of Initial Value Problems
• Structured Backward Error and Condition of Generalized Eigenvalue Problems
• Accuracy and Stability of Numerical Algorithms
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• Structured Eigenvalue Condition Numbers
• A Theory of Condition
• A Class of Triple-Diagonal Matrices for Test Purposes