Effective algorithms for decomplexifying a matrix by unitary similarities or congruences

DOI10.1134/S0001434612110211zbMath1266.15019OpenAlexW2062355004MaRDI QIDQ1946442

Khakim D. Ikramov

Publication date: 15 April 2013

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434612110211

zbMATH Keywords

algorithmpolar decompositionunitary similarityirreducible matrixconsimilarityunitary congruence

Mathematics Subject Classification ID

Related Items (1)

Unnamed Item

Cites Work

• On complex matrices that are unitarily similar to real matrices
• A criterion for unitary congruence between matrices
• Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices
• A note on complex matrices that are unitarily congruent to real matrices
• A complete set of unitary invariants for operators generating finite \(W^ *\)-algebras of type I
• Matrix Analysis
• Is the Polar Decomposition Finitely Computable?

This page was built for publication: Effective algorithms for decomplexifying a matrix by unitary similarities or congruences