Abstract
The solution of the Sylvester equation, AX+XB=C, can be obtained by reducing it to triangular Schur form. Here we design systolic algorithms for solving this reduced equation in bidimensional arrays and in linear arrays. By using data partition techniques we obtain size independent algorithms in both 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: Algorithms and Architectures for Real-Time Control 1992
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.
