Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices

DOI10.1134/S1064562411020086zbMath1232.15014OpenAlexW2073481643MaRDI QIDQ656271

Khakim D. Ikramov

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

zbMATH Keywords

complex matricesunitary similarityfinite algorithms

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21)

Related Items

Simultaneous decomplexification of a pair of complex matrices by a unitary congruence transformation, Effective algorithms for decomplexifying a matrix by unitary similarities or congruences, Simultaneous decomplexification of a pair of complex matrices via a unitary similarity transformation, How to distinguish between the latently real matrices and the block quaternions?, OPUC, CMV matrices and perturbations of measures supported on the unit circle

Cites Work

• An upper bound for the length of a finite-dimensional algebra
• A complete set of unitary invariants for operators generating finite \(W^ *\)-algebras of type I
• Matrix Analysis
• A characterization of unitary congruence
• Simultaneous similarity of matrices