Computing the eigenvectors of nonsymmetric tridiagonal matrices
DOI10.1134/S0965542521050080zbMATH Open1469.65077OpenAlexW3189669051MaRDI QIDQ2038484FDOQ2038484
Authors: T. Laudadio, Nicola Mastronardi, 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
Recommendations
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- scientific article; zbMATH DE number 3930234
- Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perturbation Analyses for the QR Factorization
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Title not available (Why is that?)
- Computing an Eigenvector with Inverse Iteration
- Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- Eigenvectors of tridiagonal matrices of Sylvester type
- The ELR Method for Computing the Eigenvalues of a General Matrix
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- Forward Instability of Tridiagonal QR
- The transmission of shifts and shift blurring in the QR algorithm
- On the Reduction of an Arbitrary Real Square Matrix to Tridiagonal Form
- Accurate computation of the zeros of the generalized Bessel polynomials
Cited In (15)
- Computation of multiple eigenvalues of infinite tridiagonal matrices
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Title not available (Why is that?)
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- New applications of matrix methods
- Computation of an eigenvector of a symmetric tridiagonal matrix
- On rutishauser's modified method for computing the eigenvalues of real tridiagonal symmetric matrices
- A note on eigenvalue computation for a tridiagonal matrix with real eigenvalues
- Calcolo degli autovalori di matrici tridiagonali non normali
- Computing Gaussian quadrature rules with high relative accuracy
- A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
- On the computation of the SVD of Fourier submatrices
- Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
Uses Software
This page was built for publication: Computing the eigenvectors of nonsymmetric tridiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038484)
