VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

A Homotopy Algorithm for the Combined H-squared/H-to Infinity Model Reduction Problem

Files

TR Number

TR-93-15

Date

1993-05-01

Journal Title

Journal ISSN

Volume Title

Publisher

Department of Computer Science, Virginia Polytechnic Institute & State University

Abstract

The problem of finding a reduced order model, optimal in the H-squared sense, to a given system model is a fundamental one in control system analysis and design. The addition of a H-to infinity constraint to the H-squared optimal model reduction problem results in a more practical yet computationally more difficult problem. Without the global convergence of probability-one homotopy methods the combined H-squared/H-to infinity model reduction problem is difficult to solve. Several approaches based on homotoppy methods have been proposed. The issues are the number of degrees of freedom, the well posedness of the finite dimensional optimization problem, and the numerical robustness of the resulting homotopy algorithm. Homotopy algorithms based on two formulations - input normal form; Ly, Bryson, and Cannon's 2 x 2 block parametrization - are developed and compared here.

Description

Keywords

Citation