Reduction of a General Matrix to Tridiagonal Form

DOI10.1137/0612026zbMath0725.65039OpenAlexW2103943585MaRDI QIDQ5203567

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

performancealgorithmeigenvaluesreduction to tridiagonal formrecovery algorithmsconditional transformation matricespivoting scheme

Mathematics Subject Classification ID

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

Related Items

Polynomial roots: The ultimate answer?, Numerical impluimentation of a new algorithm for polynomials with multiple roots, A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms, Simultaneous similarity reductions for a pair of matrices to condensed forms, Algorithms for model reduction of large dynamical systems, Design of reduced-order, H₂ optimal controllers using a homotopy algorithm, Efficent computation of eigenvalues of randomly generated matrices, A parallel preconditioning technique for boundary value methods