Abstract
The numerical algorithms for solving equations of the type AX + X T B = C or AX + X*B = C that were earlier proposed by the authors are now modified for the situations where these equations can be regarded as self-adjoint ones. The economy in computational time and work achieved through these modifications is illustrated by numerical results.
Similar content being viewed by others
References
Kh. D. Ikramov, “Conditions for unique solvability of the matrix equation AX + X T B = C,” Dokl. Math. 81, 63–65 (2010).
Kh. D. Ikramov and Yu. O. Vorontsov, “On the unique solvability of the matrix equation AX + X T B = C in the singular case,” Dokl. Math. 83, 380–383 (2011).
Yu. O. Vorontsov and Kh. D. Ikramov, “A numerical algorithm for solving the matrix equation AX + X T B = C,” Comput. Math. Math. Phys. 51, 691–698 (2011).
Yu. O. Vorontsov and Kh. D. Ikramov, “Conditions for unique solvability of the matrix equation AX + X*B = C,” Comput. Math. Math. Phys. 52, 665–673 (2012).
Yu. O. Vorontsov, “Numerical algorithm for solving the matrix equation AX + X*B = C,” Moscow Univ. Comput. Math. Cybernetics 37(1), 1–7 (2013).
Kh. D. Ikramov, “Linear matrix equations of the Sylvester type in the self-conjugate case,” Dokl. Math. 87, 286–288 (2013).
Kh. D. Ikramov, “Self-conjugacy conditions for semilinear matrix equations,” Dokl. Math. 87, 331–333 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.O. Vorontsov, Khakim D. Ikramov, 2014, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2014, Vol. 54, No. 2, pp. 179–182.
Rights and permissions
About this article
Cite this article
Vorontsov, Y.O., Ikramov, K.D. Numerical solution of the matrix equations AX + X T B = C and AX + X*B = C in the self-adjoint case. Comput. Math. and Math. Phys. 54, 191–194 (2014). https://doi.org/10.1134/S0965542514020146
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542514020146