The pseudosymmetric tridiagonalization of an arbitrary real matrix
From MaRDI portal
Publication:917222
DOI10.1016/0024-3795(90)90294-MzbMath0704.65029MaRDI QIDQ917222
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmnumerical examplesmatrix reductionperturbation bounds of eigenvaluespseudosymmetric tridiagonalization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A reduction algorithm for reconstructing periodic Jacobi matrices in Minkowski spaces ⋮ An inverse eigenvalue problem: Computing \(B\)-stable Runge-Kutta methods having real poles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- The ELR Method for Computing the Eigenvalues of a General Matrix
- An Application of the $LR$ Factorization to Sequential Tridiagonalization Methods
- The Reduction of an Arbitrary Real Square Matrix to Tri-Diagonal Form Using Similarity Transformations
This page was built for publication: The pseudosymmetric tridiagonalization of an arbitrary real matrix
