Abstract
The algorithms for solving the equations X − AX T B = C and X − AX*B = C proposed by the authors in earlier publications are now modified for the case where these equations can be regarded as self-adjoint ones. The economy in the computational time and work achieved through these modifications is illustrated by numerical results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kh. D. Ikramov and Yu. O. Vorontsov, “The matrix equation X + AX T B = C: Conditions for unique solvability and a numerical algorithm for its solution,” Dokl. Math. 85, 265–267 (2012).
Yu. O. Vorontsov and Kh. D. Ikramov, “Numerical solution of matrix equations of the form X + AX T B = C,” Comput. Math. Math. Phys. 53, 253–257 (2013).
Yu. O. Vorontsov, “Modifying a numerical algorithm for solving the matrix equation X + AX T B = C,” Comput. Math. Math. Phys. 53, 677–680 (2013).
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, “Self-conjugacy conditions for matrix equations of the Stein type,” Dokl. Math. 88, 451–452 (2013).
Yu. O. Vorontsov and Kh. D. Ikramov, “Numerical solution of the matrix equations AX + X T B = C and X + AX T B = C with rectangular coefficients,” J. Math. Sci. 191(1), 28–30 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.O. Vorontsov, Kh.D. Ikramov, 2014, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2014, Vol. 54, No. 5, pp. 723–727.
Rights and permissions
About this article
Cite this article
Vorontsov, Y.O., Ikramov, K.D. Numerical solution of matrix equations of the Stein type in the self-adjoint case. Comput. Math. and Math. Phys. 54, 745–749 (2014). https://doi.org/10.1134/S096554251405008X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S096554251405008X