Reduction of a General Matrix to Tridiagonal Form
DOI10.1137/0612026zbMATH Open0725.65039OpenAlexW2103943585MaRDI QIDQ5203567FDOQ5203567
Authors: George A. Geist 
Publication date: 1991
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b98587e8e64b676c586c3cc1bebb0e3b1c86e93b
Recommendations
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
- Block reduction of matrices to condensed forms for eigenvalue computations
- A Parallel Algorithm for the Reduction to Tridiagonal Form for Eigendecomposition
performanceeigenvaluesalgorithmreduction to tridiagonal formrecovery algorithmsconditional transformation matricespivoting scheme
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (26)
- Reduction of Matrix Polynomials to Simpler Forms
- On the fast reduction of symmetric rationally generated Toeplitz matrices to tridiagonal form
- Algorithms for model reduction of large dynamical systems
- The result of two steps of the \(LR\) algorithm is diagonally similar to the result of one step of the \(HR\) algorithm
- On orthogonal reduction to Hessenberg form with small bandwidth
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
- Reduction to Tridiagonal Form and Minimal Realizations
- Title not available (Why is that?)
- Simultaneous similarity reductions for a pair of matrices to condensed forms
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- An input/output efficient algorithm for Hessenberg reduction
- Reduced form of the interactor matrix
- A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices
- An Improved Laguerre Eigensolver for Unsymmetric Matrices
- Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
- A parallel preconditioning technique for boundary value methods
- A Finite Procedure for the Tridiagonalization of a General Matrix
- Title not available (Why is that?)
- QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
- Polynomial roots: The ultimate answer?
- Efficent computation of eigenvalues of randomly generated matrices
- Title not available (Why is that?)
- Partitioned triangular tridiagonalization
- The pseudosymmetric tridiagonalization of an arbitrary real matrix
- Title not available (Why is that?)
- Design of reduced-order, H2 optimal controllers using a homotopy algorithm
This page was built for publication: Reduction of a General Matrix to Tridiagonal Form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203567)
