Geodesic
Neutral subspaces of complex matrices
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVIII, Tome 439 (2015), pp. 93-98 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

Consider the quadratic matrix equation $X^TDX+AX+X^TB+C=0$, where all the matrices are square and have the same order $n$. With this equation, we associate a block matrix $M$ of the double order $2n$. the solvability of the equation turns out to be related to the existence of neutral subspaces of dimension $n$ for this matrix. Reasonably general conditions ensuring the existence of such subspaces are presented. 
@article{ZNSL_2015_439_a7,
     author = {Kh. D. Ikramov},
     title = {Neutral subspaces of complex matrices},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {93--98},
     year = {2015},
     volume = {439},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a7/}
}
TY  - JOUR
AU  - Kh. D. Ikramov
TI  - Neutral subspaces of complex matrices
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2015
SP  - 93
EP  - 98
VL  - 439
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a7/
LA  - ru
ID  - ZNSL_2015_439_a7
ER  - 
%0 Journal Article
%A Kh. D. Ikramov
%T Neutral subspaces of complex matrices
%J Zapiski Nauchnykh Seminarov POMI
%D 2015
%P 93-98
%V 439
%U http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a7/
%G ru
%F ZNSL_2015_439_a7
Kh. D. Ikramov. Neutral subspaces of complex matrices. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVIII, Tome 439 (2015), pp. 93-98. http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a7/