Rationally verifiable necessary conditions for Hermitian congruence of complex matrices

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^*AQ$ for a nonsingular matrix $Q$. The paper gives a survey of necessary conditions for Hermitian congruence verifiable by rational algorithms.