The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem

DOI10.1137/S0895479803429788MaRDI QIDQ5317658zbMATH OpenOpenAlexFDO

Authors Dario A. Bini, L. Gemignani, Françoise Tisseur

Publication date 19 September 2005

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

divide and conquerEhrlich-Aberth algorithmerror boundsNewton correctionnonsymmetric eigenvalue problemQR decompositionroot findersymmetric indefinite generalized eigenvalue problemtridiagonal matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• Computing the eigenvectors of nonsymmetric tridiagonal matrices
• A new algorithm for the symmetric tridiagonal eigenvalue problem
• scientific article; zbMATH DE number 741157
• Publication:3474211
• A numerical method for calculating eigenvalues of a tridiagonal symmetric matrix

Cited in

(25)

• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• Efficient computation of tridiagonal matrices largest eigenvalue
• A new method for eigenvalues of nonsymmetric matrices
• Weyl's quadtree algorithm for the unsymmetric eigenvalue problem
• Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
• Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
• Computing the eigenvectors of nonsymmetric tridiagonal matrices
• A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices
• Limiting spectral distribution of large-dimensional sample covariance matrices generated by the periodic autoregressive model
• Structured Eigenvalue Problems
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
• scientific article; zbMATH DE number 1839628 (Why is no real title available?)
• A note on eigenvalue computation for a tridiagonal matrix with real eigenvalues
• Linearizations of Hermitian matrix polynomials preserving the sign characteristic
• Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
• A generalized eigenvalue algorithm for tridiagonal matrix pencils based on a nonautonomous discrete integrable system
• A Matlab package computing simultaneous Gaussian quadrature rules for multiple orthogonal polynomials
• On computing the zeros of Laguerre-Sobolev polynomials
• Computational aspects of simultaneous Gaussian quadrature
• Efficient computation of dominant eigenvalues using adaptive block Lanczos with Chebyshev filtering
• Structured eigenvalue condition numbers for parameterized quasiseparable matrices
• Interlacing properties of the zeros of Althammer orthogonal polynomials and their computation
• Computing curve intersection by means of simultaneous iterations

Describes a project that uses

Uses Software

• LAPACK

This page was built for publication: The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem

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