The ELR Method for Computing the Eigenvalues of a General Matrix

DOI10.1137/0718038MaRDI QIDQ3925801zbMATH OpenOpenAlexFDO

Authors 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 experimentseliminationHessenberg matrixQR algorithmLR methodfull nonsymmetric matrix

Mathematics Subject Classification ID

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

Cited in

(6)

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

Describes a project that uses

Uses Software

• EISPACK

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925801)