Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation
From MaRDI portal
Recommendations
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- scientific article; zbMATH DE number 3930234
- Computation of an eigenvector of a symmetric tridiagonal matrix
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- Publication:3474211
- scientific article; zbMATH DE number 146489
- A numerical method for calculating eigenvalues of a tridiagonal symmetric matrix
- A particular method for the determination of eigenvalues of symmetric tridiagonal matrices
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- Eigenvector matrices of symmetric tridiagonals
Cites work
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- Accuracy and Stability of Numerical Algorithms
- Fast and stable unitary QR algorithm
- scientific article; zbMATH DE number 3278338 (Why is no real title available?)
- LAPACK Users' Guide
- Perturbation Bounds for the $QR$ Factorization of a Matrix
- The QR algorithm for unitary Hessenberg matrices
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
Cited in
(7)- Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Connecting optimization with spectral analysis of tri-diagonal matrices
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- scientific article; zbMATH DE number 1839628 (Why is no real title available?)
- Computing the eigenvalues of matrices of the orthogonal and unitary symplectic groups
- The eigenvalue decomposition of normal matrices by the skew-symmetric part
This page was built for publication: Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744301)