Abstract
An approach to forming analytical solutions of the discrete and continuous Sylvester and Lyapunov linear algebraic matrix equations is described. The approach is based on reducing the square matrix to the Jordan normal form. Examples, algorithms, and implementations in Matlab are presented.
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: Journal of Computer and Systems Sciences International
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.
