The ELR Method for Computing the Eigenvalues of a General Matrix

DOI10.1137/0718038zbMath0472.65035OpenAlexW2008240981MaRDI QIDQ3925801

Achiya Dax, Shmuel Kaniel

Publication date: 1981

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0718038

zbMATH Keywords

stabilitynumerical experimentseliminationQR algorithmHessenberg matrixLR methodfull nonsymmetric matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (6)

The pseudosymmetric tridiagonalization of an arbitrary real matrix ⋮ A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms ⋮ Computing the eigenvectors of nonsymmetric tridiagonal matrices ⋮ Large-scale complex eigenvalue problems ⋮ Convergence of algorithms of decomposition type for the eigenvalue problem ⋮ Solution of Lyapunov equations by alternating direction implicit iteration

Uses Software

• EISPACK

This page was built for publication: The ELR Method for Computing the Eigenvalues of a General Matrix