Abstract:
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.