Modifying a numerical algorithm for solving the matrix equation $X+AX^TB=C$
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 53 (2013) no. 6, pp. 853-856
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Certain modifications are proposed for a numerical algorithm solving the matrix equation $X+AX^TB=C$. By keeping the intermediate results in storage and repeatedly using them, it is possible to reduce the total complexity of the algorithm from $O(n^4)$ to $O(n^3)$ arithmetic operations.
[1] Zhou V., Lam J., Duan C.-R., “Toward solution of matrix equation $X=Af(X)B+C$”, Linear Algebra Appl., 435:11 (2011), 1370–1398 | DOI | MR | Zbl
[2] Ikramov Kh. D., Vorontsov Yu. O., “Matrichnoe uravnenie $X+AX^{\mathrm T}B=C$: usloviya odnoznachnoi razreshimosti i algoritm chislennogo resheniya”, Dokl. AN, 443:5 (2012), 545–548 | MR | Zbl