A QL Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
From MaRDI portal
A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
Recommendations
- scientific article; zbMATH DE number 169552
- A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
- Publication:3474211
- A short note on the implicit QL algorithm for symmetric tridiagonal matrices
- An iterative method for solving the spectral problem of complex symmetric matrices
Cited in
(14)- A fast method to diagonalize a Hankel matrix
- A hybrid iterative method for symmetric indefinite linear systems
- A fast eigenvalue algorithm for Hankel matrices
- An iterative method for solving the spectral problem of complex symmetric matrices
- Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- A class of accelerated parameterized inexact Uzawa algorithms for complex symmetric linear systems
- Fast parameterized inexact Uzawa method for complex symmetric linear systems
- A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
- On rutishauser's modified method for computing the eigenvalues of real tridiagonal symmetric matrices
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- scientific article; zbMATH DE number 727777 (Why is no real title available?)
- A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
- On tridiagonal matrices unitarily equivalent to normal matrices
This page was built for publication: A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870624)