|
This article is cited in 3 scientific papers (total in 3 papers)
Numerical algorithms for solving matrix equations $AX+BX^T=C$ and $AX+BX^*=C$
Yu. O. Vorontsov, Khakim D. Ikramov M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
Conditions for the unique solvability of matrix equations of the form $AX+BX^T=C$ and $AX+BX^*=C$ are found. Numerical algorithms of the Bartels–Stewart type for solving such equations are described. Certain numerical tests with these algorithms are presented. In particular, the situation where the conditions for unique solvability are “almost” violated is modeled, and the deterioration of the quality of the computed solution in this situation is traced through.
Key words:
matrix equation, adjoint operator, QZ algorithm, matrix pencil, eigenvalue, circulant.
Received: 24.12.2012
Citation:
Yu. O. Vorontsov, Khakim D. Ikramov, “Numerical algorithms for solving matrix equations $AX+BX^T=C$ and $AX+BX^*=C$”, Zh. Vychisl. Mat. Mat. Fiz., 53:6 (2013), 843–852; Comput. Math. Math. Phys., 53:6 (2013), 667–676
Linking options:
https://www.mathnet.ru/eng/zvmmf9834 https://www.mathnet.ru/eng/zvmmf/v53/i6/p843
|
|