Reduction of a General Matrix to Tridiagonal Form

DOI10.1137/0612026MaRDI QIDQ5203567zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmconditional transformation matriceseigenvaluesperformancepivoting schemerecovery algorithmsreduction to tridiagonal form

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

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

Cited in

(29)

• On orthogonal reduction to Hessenberg form with small bandwidth
• A parallel preconditioning technique for boundary value methods
• A graph-theoretic model of symmetric Givens operations and its implications
• Efficent computation of eigenvalues of randomly generated matrices
• Polynomial roots: The ultimate answer?
• Simultaneous similarity reductions for a pair of matrices to condensed forms
• Algorithms for model reduction of large dynamical systems
• Partitioned triangular tridiagonalization
• scientific article; zbMATH DE number 4216438 (Why is no real title available?)
• scientific article; zbMATH DE number 3916470 (Why is no real title available?)
• Reduction to Tridiagonal Form and Minimal Realizations
• Reduced form of the interactor matrix
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices
• Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form
• An Improved Laguerre Eigensolver for Unsymmetric Matrices
• Reduction of Matrix Polynomials to Simpler Forms
• Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
• Design of reduced-order, H₂ optimal controllers using a homotopy algorithm
• On Tridiagonalizing and Diagonalizing Symmetric Matrices with Repeated Eigenvalues
• scientific article; zbMATH DE number 2113600 (Why is no real title available?)
• A Finite Procedure for the Tridiagonalization of a General Matrix
• Numerical impluimentation of a new algorithm for polynomials with multiple roots
• The result of two steps of the \(LR\) algorithm is diagonally similar to the result of one step of the \(HR\) algorithm
• An input/output efficient algorithm for Hessenberg reduction
• QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
• scientific article; zbMATH DE number 5059813 (Why is no real title available?)
• The pseudosymmetric tridiagonalization of an arbitrary real matrix
• On the fast reduction of symmetric rationally generated Toeplitz matrices to tridiagonal form

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)