Extensions to the Bartels-Stewart algorithm for linear matrix equations

It is shown that the Bartels-stewart algorithm can be extended to treat the adjoint and nonsymmetric matrix equations, while taking advantage of substantial savings in computer time afforded by the sequential solution property of the algorithm.