Abstract
The problem of developing numerical algorithms for calculating finite-dimensional realizations of time-invariant linear discrete input-output mapping systems in state space as recurrent sequences of matrices is considered. A method for calculating such a realization on the basis of LU decomposition of the Hankel matrix of the system's behavior is proposed.
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: 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.
