Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kleinman et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: