QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
From MaRDI portal
Recommendations
- Reduction of a General Matrix to Tridiagonal Form
- scientific article; zbMATH DE number 1971714
- A Parallel Algorithm for the Reduction to Tridiagonal Form for Eigendecomposition
- The result of two steps of the \(LR\) algorithm is diagonally similar to the result of one step of the \(HR\) algorithm
- Partitioned triangular tridiagonalization
Cited in
(14)- Stable double LR algorithm and its error analysis
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Partitioned triangular tridiagonalization
- Reduction to Tridiagonal Form and Minimal Realizations
- Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
- A Finite Procedure for the Tridiagonalization of a General Matrix
- Checking nonsingularity of tridiagonal matrices
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- The result of two steps of the \(LR\) algorithm is diagonally similar to the result of one step of the \(HR\) algorithm
- Reduction of a General Matrix to Tridiagonal Form
- On the simultaneous tridiagonalization of two symmetric matrices
- Lanczos tridiagonalization and core problems
- The pseudosymmetric tridiagonalization of an arbitrary real matrix
This page was built for publication: QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317631)