The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
From MaRDI portal
Publication:5317658
DOI10.1137/S0895479803429788zbMath1089.65030OpenAlexW2156010245MaRDI QIDQ5317658
Luca Gemignani, Dario Andrea Bini, 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
error boundstridiagonal matrixQR decompositiondivide and conquerNewton correctionnonsymmetric eigenvalue problemsymmetric indefinite generalized eigenvalue problemEhrlich-Aberth algorithmroot finder
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Computing curve intersection by means of simultaneous iterations, Limiting spectral distribution of large-dimensional sample covariance matrices generated by the periodic autoregressive model, Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method, Linearizations of Hermitian Matrix Polynomials Preserving the Sign Characteristic, Constructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev Bases, 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, Structured Eigenvalue Problems, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, Computing the eigenvectors of nonsymmetric tridiagonal matrices, A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
Uses Software
