Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXIV, Tome 395 (2011), pp. 5-8
Citer cet article
A. K. Abdikalykov; Kh. D. Ikramov. Simultaneous decomplexification of a pair of complex matrices via a unitary similarity transformation. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXIV, Tome 395 (2011), pp. 5-8. http://geodesic.mathdoc.fr/item/ZNSL_2011_395_a0/
@article{ZNSL_2011_395_a0,
author = {A. K. Abdikalykov and Kh. D. Ikramov},
title = {Simultaneous decomplexification of a~pair of complex matrices via a~unitary similarity transformation},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {5--8},
year = {2011},
volume = {395},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2011_395_a0/}
}
TY - JOUR
AU - A. K. Abdikalykov
AU - Kh. D. Ikramov
TI - Simultaneous decomplexification of a pair of complex matrices via a unitary similarity transformation
JO - Zapiski Nauchnykh Seminarov POMI
PY - 2011
SP - 5
EP - 8
VL - 395
UR - http://geodesic.mathdoc.fr/item/ZNSL_2011_395_a0/
LA - ru
ID - ZNSL_2011_395_a0
ER -
%0 Journal Article
%A A. K. Abdikalykov
%A Kh. D. Ikramov
%T Simultaneous decomplexification of a pair of complex matrices via a unitary similarity transformation
%J Zapiski Nauchnykh Seminarov POMI
%D 2011
%P 5-8
%V 395
%U http://geodesic.mathdoc.fr/item/ZNSL_2011_395_a0/
%G ru
%F ZNSL_2011_395_a0
Let $(A,B)$ be a given pair of complex $n\times n$ matrices and let at least one of these matrices be unitarily irreducible. An algorithm for verifying whether $A$ and $B$ can be made real via the same unitary similarity transformation is proposed and justified.
