Abstract
AbstractThe classical Rosenbrock's algorithm (based on the Gauss elimination method) for n‐dimensional linear time invariant state equation matrices is analysed and modernized. The method of orthogonal similarity reduction to block Hessenberg form is used to assure numerical stability. The updated version of the Rosenbrock's algorithm is then justified in a very easy way using properties of Krylov matrices. Additionally, this algorithm can be used to determine an equivalence transformation which converts an n‐dimensional linear state equation into a controllable form (or a time invariant one into an equivalent observable form). It is advantageous for big and medium size problems and can be easily parallelized. Numerical examples 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 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.
