|
This article is cited in 1 scientific paper (total in 1 paper)
Numerical algorithm for solving sesquilinear matrix equations of a certain class
Yu. O. Vorontsov, Kh. D. Ikramov Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992, Russia
Abstract:
A relationship is found between the solutions to the sesquilinear matrix equation $X^*DX+AX+X^*B+C=0$, where all the matrix coefficients are $n\times n$ matrices, and the neutral subspaces of the $2n\times 2n$ matrix $M=\begin{pmatrix}C& A\\ B& D\end{pmatrix}$. This relationship is used to design an algorithm for solving matrix equations of the indicated type. Numerical results obtained with the help of the proposed algorithm are presented.
Key words:
sesquilinear matrix equation, neutral subspace, quasi-definite matrix, reduction to diagonal form.
Received: 26.12.2013
Citation:
Yu. O. Vorontsov, Kh. D. Ikramov, “Numerical algorithm for solving sesquilinear matrix equations of a certain class”, Zh. Vychisl. Mat. Mat. Fiz., 54:6 (2014), 901–904; Comput. Math. Math. Phys., 54:6 (2014), 915–918
Linking options:
https://www.mathnet.ru/eng/zvmmf10043 https://www.mathnet.ru/eng/zvmmf/v54/i6/p901
|
|