Abstract
The matrix equation AX + XB = C, where XB is obtained by the entry-wise conjugation of X, is examined. On the basis of analogy with the Sylvester matrix equation, special cases are distinguished where the former equation corresponds to normal and self-adjoint Sylvester equations. Efficient numerical algorithms are proposed for these special cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
