Abstract
The calculation of the balancing transformation required in Moore's "balanced-transformation" model reduction procedure tends to be badly conditioned, especially for non-minimal models that stand to benifit the most from model reduction. In this paper it is shown that the Moore reduced model can be computed directly without balancing via projections defined in terms of arbitary bases for the left and right eigenspaces associated with the "large" eigenvalues of the product PQ of the reachability and controllablility grammians. Two methods for computing these bases are proposed, one based on the ordered Schur decomposition of PQ and the other based on the Cholesky factors of P and Q. The algorithms perform reliably even for non-minimal models.
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.
