Abstract

We present a new systematic procedure to find low-order linear fractional representations of systems with polynomial parametric uncertainty. The idea is to exploit the structure of the uncertainty to decompose a multidimensional polynomial matrix into sums and products of simple factors for which minimal linear fractional representations can be obtained. This approach is implemented in the structured tree decomposition algorithm, which generates a tree whose leaves are simple factors. An example is presented to illustrate the advantages of this approach.

Publication Date

1997

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

Computer Engineering (KGCOE)

Campus

RIT – Main Campus

Share

COinS