Two classes of matrices with fast computable spectra
From MaRDI portal
Publication:749155
zbMATH Open0712.65026MaRDI QIDQ749155FDOQ749155
Authors: Kh. D. Ikramov
Publication date: 1989
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Recommendations
- Spectrum and eigenvectors for a class of tridiagonal matrices
- scientific article; zbMATH DE number 4211376
- Fast algorithms for calculating the eigenvalues of normal Hankel matrices
- Computing the eigenvalues of matrices of the orthogonal and unitary symplectic groups
- A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices
algorithmseigenvaluesHessenberg matricesCaley transformsskew- symmetric tridiagonal matricestridiagonal orthogonal matrices
Cited In (4)
- Computing the eigenvalues of matrices of the orthogonal and unitary symplectic groups
- Characterization of some matrix classes involving some sets with speed
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Calculating the eigenvalues of real blocked matrices of a special class
This page was built for publication: Two classes of matrices with fast computable spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749155)