|
Zapiski Nauchnykh Seminarov POMI, 2019, Volume 482, Pages 120–128
(Mi znsl6829)
|
|
|
|
Rationally verifiable necessary conditions for Hermitian congruence of complex matrices
Kh. D. Ikramov Lomonosov Moscow State University
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^*AQ$ for a nonsingular matrix $Q$. The paper gives a survey of necessary conditions for Hermitian congruence verifiable by rational algorithms.
Key words and phrases:
$*$-congruence, rational algorithm, canonical form w.r.t. congruences, cosquare, Toeplitz decomposition.
Received: 15.01.2019
Citation:
Kh. D. Ikramov, “Rationally verifiable necessary conditions for Hermitian congruence of complex matrices”, Computational methods and algorithms. Part XXXII, Zap. Nauchn. Sem. POMI, 482, POMI, St. Petersburg, 2019, 120–128
Linking options:
https://www.mathnet.ru/eng/znsl6829 https://www.mathnet.ru/eng/znsl/v482/p120
|
Statistics & downloads: |
Abstract page: | 137 | Full-text PDF : | 67 | References: | 43 |
|