A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
From MaRDI portal
Publication:2117301
DOI10.1007/S00211-021-01254-ZzbMATH Open1490.65060OpenAlexW4205599377MaRDI QIDQ2117301FDOQ2117301
Authors: Carla Ferreira, Beresford N. Parlett 
Publication date: 21 March 2022
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-021-01254-z
Recommendations
- Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
- Skew-Symmetric Differential qd Algorithm
- scientific article; zbMATH DE number 741157
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
- A Class of Triple-Diagonal Matrices for Test Purposes
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- The LR transformation method for symmetric matrices
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Relation Between the QR and LR Algorithms
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Title not available (Why is that?)
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- Fernando's solution to Wilkinson's problem: An application of double factorization
- An implementation of the dqds algorithm (positive case)
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Accurate singular values and differential qd algorithms
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
- Title not available (Why is that?)
- Der Quotienten-Differenzen-Algorithmus
- Reduction to Tridiagonal Form and Minimal Realizations
- Title not available (Why is that?)
- Orthogonal Eigenvectors and Relative Gaps
- Title not available (Why is that?)
- Convergence of LR algorithm for a one-point spectrum tridiagonal matrix
- Accurate computation of the zeros of the generalized Bessel polynomials
- The inverse eigenvector problem for real tridiagonal matrices
- Twisted factorizations and qd-type transformations for the MR\(^{3}\) algorithm -- new representations and analysis
- The result of two steps of the \(LR\) algorithm is diagonally similar to the result of one step of the \(HR\) algorithm
Cited In (1)
Uses Software
This page was built for publication: A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117301)
