Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- 27 February 2008
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 47 (3) , 253-273
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal formsLinear Algebra and its Applications, 2007
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary orderLinear Algebra and its Applications, 2005
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equationsNumerische Mathematik, 2005
- Inverse power and Durand-Kerner iterations for univariate polynomial root-findingComputers & Mathematics with Applications, 2004
- Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form2003
- Fundamentals of Matrix Computations2002
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matricesLinear Algebra and its Applications, 2000
- LAPACK Users' Guide1999
- Nonsymmetric Algebraic Riccati Equations and Hamiltonian-like MatricesSIAM Journal on Matrix Analysis and Applications, 1998
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1The Computer Journal, 1961