Abstract
The authors attempt to make significant progress in developing novel stable, globally convergent numerical algorithms for solving the optimality conditions for H-2/H-infinity order reduction given in W. M. Haddad (1989). The approach taken is based on the construction of probability-one homotopy maps. Homotopy algorithms based on two formulations - input normal form; and Ly, Bryson, and Cannon's (1985) 2 /spl times/ 2 block parametrization - are developed and compared. Numerical results are presented. >
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.
