By Topic

The partial model matching or partial disturbance rejection problem: geometric and structural solutions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Malabre ; Lab. d'Autom., CNRS, Nantes, France ; J. C. H. Garcia

The partial model matching problem (or equivalently, the partial disturbance rejection problem) is revisited. It has been initially introduced in Emre and Silverman (1980) and amounts to matching the first k Markov parameters of the plant with those of the model. This obviously finds all its interest when no solution exists to the exact problem. The authors give both geometric and structural solutions to these problems. The geometric solution is in terms of the steps of the well known supremal output nulling controlled invariant subspace algorithm. The structural conditions amount to comparing some list of integers, namely some orders of zeros at infinity

Published in:

IEEE Transactions on Automatic Control  (Volume:40 ,  Issue: 2 )