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 is a survey of the necessary conditions for Hermitian congruences that are verifiable by rational al...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2020-10, Vol.249 (2), p.189-194
Main Author: Ikramov, Kh. D.
Format: Article
Language:English
Subjects:
Algorithms
Congruences
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 is a survey of the necessary conditions for Hermitian congruences that are verifiable by rational algorithms. Bibliography: 7 titles.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-020-04932-9