Computing the eigenvectors of nonsymmetric tridiagonal matrices

DOI10.1134/S0965542521050080zbMath1469.65077OpenAlexW3189669051MaRDI QIDQ2038484

Nicola Mastronardi, T. Laudadio, Paul Van Dooren

Publication date: 7 July 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542521050080

zbMATH Keywords

Bessel matriceseigenvectors computationnonsymmetric tridiagonal matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Computing Gaussian quadrature rules with high relative accuracy, On the computation of the SVD of Fourier submatrices, New applications of matrix methods

Uses Software

• Algorithm 710

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvectors of tridiagonal matrices of Sylvester type
• Accurate computation of the zeros of the generalized Bessel polynomials
• The transmission of shifts and shift blurring in the QR algorithm
• Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• On Computing Eigenvectors of Symmetric Tridiagonal Matrices
• The ELR Method for Computing the Eigenvalues of a General Matrix
• Forward Instability of Tridiagonal QR
• Perturbation Analyses for the QR Factorization
• Computing an Eigenvector with Inverse Iteration
• Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• On the Reduction of an Arbitrary Real Square Matrix to Tridiagonal Form