Abstract
Algorithms of the Bartels–Stewart type for the numerical solution of Sylvester matrix equations of modest size are modified for the case where the linear operators associated with these equations are normal. The superiority of the modified algorithms over the original ones is illustrated by numerical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have