Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices
From MaRDI portal
Publication:656271
DOI10.1134/S1064562411020086zbMATH Open1232.15014OpenAlexW2073481643MaRDI QIDQ656271FDOQ656271
Publication date: 17 January 2012
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562411020086
Cites Work
Cited In (10)
- How to distinguish between the latently real matrices and the block quaternions?
- Simultaneous decomplexification of a pair of complex matrices via a unitary similarity transformation
- A heuristic rational algorithm for checking the congruence of normal matrices
- Simultaneous decomplexification of a pair of complex matrices by a unitary congruence transformation
- An \(NC^ 2\) algorithm for testing similarity of matrices
- Verifying unitary congruence of coninvolutions, skew-coninvolutions, and connilpotent matrices of index two
- Finite spectral procedures in linear algebra
- 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
- OPUC, CMV matrices and perturbations of measures supported on the unit circle
This page was built for publication: Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656271)