Numerical solution of Sylvester matrix equations in the self-adjoint case

Algorithms of the Bartels-Stewart type for numerically solving Sylvester matrix equations of modest size are modified for the case where the linear operators associated with these equations are self-adjoint. The superiority of the modified algorithms over the original ones is illustrated by numerical results.