Rationally Verifiable Necessary Conditions for Hermitian Congruence of Complex Matrices.

Authors :: Ikramov, Kh. D.
Source :: Journal of Mathematical Sciences; Aug2020, Vol. 249 Issue 2, p189-194, 6p
Publication Year :: 2020
Abstract: A finite computational process using arithmetic operations only is called a rational algorithm. Matrices A and F are said to be Hermitian congruent if F = Q<superscript>∗</superscript>AQ for a nonsingular matrix Q. The paper is a survey of the necessary conditions for Hermitian congruences that are verifiable by rational algorithms. Bibliography: 7 titles. [ABSTRACT FROM AUTHOR]

Subjects :: COMPLEX matrices
HERMITIAN forms
GEOMETRIC congruences
ALGORITHMS
BIBLIOGRAPHY
MATRICES (Mathematics)
CONGRUENCE lattices

Full Text Access

Tools