Abstract
A review of numerical methods for solving matrix equations of the form X + AX T B = C is given. The methods under consideration were implemented in the Matlab environment. The performances of these methods are compared, including the case where the conditions for unique solvability are “almost” violated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. R. Gantmacher, The Theory of Matrices (Chelsea, New York, 1959; Fizmatgiz, Moscow, 1966).
Kh. D. Ikramov, Numerical Solution of Matrix Equations (Nauka, Moscow, 1984) [in Russian].
B. Zhou, J. Lam, and C.-R. Duan, “Toward solution of matrix equation X = Af(X)B + C,” Linear Algebra Appl. 435, 1370–1398 (2011).
Kh. D. Ikramov and Yu. O. Vorontsov, “The matrix equation X + AX TB = C: Conditions for unique solvability and a numerical algorithm for its solution,” Dokl. Math. 85, 265–267 (2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.O. Vorontsov, Khakim D. Ikramov, 2013, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2013, Vol. 53, No. 3, pp. 331–335.
Rights and permissions
About this article
Cite this article
Vorontsov, Y.O., Ikramov, K.D. Numerical solution of matrix equations of the form X + AX T B = C . Comput. Math. and Math. Phys. 53, 253–257 (2013). https://doi.org/10.1134/S0965542513030111
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542513030111