Finite spectral procedures in linear algebra
Problems motivated by the spectral theory of matrices (with either real or complex numbers) that may be solved with a finite sequence of rational operations over the ground field are considered. Error free arithmetic is assumed. These problems include the proving of diagonalizability for a given matrix \(A\), either real or complex, the determination whether two \(n \times n\) matrices \(A\) and \(B\) are similar (three methods), the determination whether \(A\) and \(B\) are unitarily similar, and the finding of the symmetrizer for a matrix \(A\), i.e. a symmetric nonsingular matrix \(X\) such that \(A^T X = X A\).
- Error-free matrix symmetrizers and equivalent symmetric matrices
- Reducibility theorems for a pair of matrices as rational criteria.
- Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices
- Effective algorithms for decomplexifying a matrix by unitary similarities or congruences
- An algorithm verifying the congruence of complex matrices whose cosquares have eigenvalues of modulus one
This page was built for publication: Finite spectral procedures in linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894532)
