Two classes of matrices with fast computable spectra

MaRDI QIDQ749155zbMATH OpenFDO

Authors Kh. D. Ikramov

Publication date 1989

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmsCaley transformseigenvaluesHessenberg matricesskew- symmetric tridiagonal matricestridiagonal orthogonal matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

Two classes of real \(n\times n\)-matrices are defined where all the eigenvalues can be calculated in \(O(n^ 2)\) arithmetic operations. The first class consists of the Caley transforms \((I-A)(I+A)^{-1}\) of all skew-symmetric tridiagonal matrices A, the second of the Caley transforms of all orthogonal upper Hessenberg matrices with positive subdiagonal and \(\det (I+A)\neq 0\). Simple algorithms for recognizing that a matrix belongs to one of these classes are also given.

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

Cited in

(4)

• Calculating the eigenvalues of real blocked matrices of a special class
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
• Characterization of some matrix classes involving some sets with speed
• Computing the eigenvalues of matrices of the orthogonal and unitary symplectic groups

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)