Abstract
An algorithm of the Bartels-Stewart type for solving the matrix equation AX + X*B = C is suggested. By applying the QZ-algorithm to the original equation, it is transformed into an equation of the same type with triangular matrix coefficients A and B. The resulting matrix equation is equivalent to the sequence of a system of linear equations with a smaller order of the coefficients of the desired solution. Using numerical examples, the authors simulate a situation where the conditions of a unique solution are “almost” violated. Deterioration of the calculated solutions is in this case followed.
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: Moscow University Computational Mathematics and Cybernetics
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.
