Abstract
A finite algorithm that uses arithmetic operations only is said to be rational. There exist rational methods for checking the congruence of a pair of Hermitian matrices or a pair of unitary ones. We propose a rational algorithm for checking the congruence of general normal matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
C. R. Johnson and S. Furtado, “A generalization of Sylvester’s law of inertia,” Linear Algebra Appl. 338, 287–290 (2001).
Kh. D. Ikramov, “Checking the congruence between accretive matrices,” Math. Notes 101 (6), 969–973 (2017).
A. George and Kh. D. Ikramov, “Addendum: Is the polar decomposition finitely computable?” SIAM J. Matrix Anal. Appl. 18 (1), 264 (1997).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Dedicated to the blessed memory of A.A. Abramov
Rights and permissions
About this article
Cite this article
Ikramov, K.D., Nazari, A.M. A Heuristic Rational Algorithm for Checking the Congruence of Normal Matrices. Comput. Math. and Math. Phys. 60, 1601–1608 (2020). https://doi.org/10.1134/S0965542520100097
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542520100097