Abstract
An algorithm for solving the centrosymmetric and anticentrosymmetric solutions of the Sylvester generalized matrix equations is proposed. The method of linear matrix inequalities is used for the construction of these solutions. The question of refining of the obtained solutions is considered. The efficiency of the suggested algorithms is shown by the examples.
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 callDisclaimer: 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.
