A finite rational algorithm that verifies the diagonalizability of a square matrix by congruence

DOI10.3103/S0278641916020059zbMATH Open1347.65077OpenAlexW2346854457MaRDI QIDQ309140FDOQ309140

Authors: Kh. D. Ikramov 

Publication date: 7 September 2016

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

Full work available at URL: https://doi.org/10.3103/s0278641916020059

Recommendations

• How to check whether given square matrices are congruent
• An algorithm verifying the congruence of complex matrices whose cosquares have eigenvalues of modulus one
• A rational criterion for congruence of square matrices
• On matrices whose cosquares are diagonalizable and have real spectra
• A heuristic rational algorithm for checking the congruence of normal matrices

zbMATH Keywords

minimal polynomialsimilaritycongruencesJordan formcanonical formcosquarerational Gaussian numbers

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21)

Cited In (4)

• A heuristic rational algorithm for checking the congruence of normal matrices
• How to check whether given square matrices are congruent
• An algorithm verifying the congruence of complex matrices whose cosquares have eigenvalues of modulus one
• Rationally verifiable necessary conditions for Hermitian congruence of complex matrices

This page was built for publication: A finite rational algorithm that verifies the diagonalizability of a square matrix by congruence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309140)