By Topic

Comments on "Realization and reduction of Markovian models from nonstationary data"

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $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)
Skelton, R. ; Purdue University, West Lafayette, IN, USA ; Davis, J.

In the above paper, Baram determines a basis in which to construct realizations from measurement data and for model reduction of these realizations. The basis selected by Baram is similar to the "cost-decoupled" basis introduced earlier [1], [2], with one exception. Both have diagonal state covariances, but the second matrix diagonalized is different. Of course, this makes the two algorithms different and the nature of these differences is pointed out in this correspondence. The principal difference is that Baram's algorithm for model reduction approximates (in a least squares sense) all of the covariance sequences, whereas the model reduction of [1], [2] matches the first two covariance sequences exactly. The cost decoupled basis guarantees several different properties: 1) output covariance matching, and 2) an equivalent quadratic performance metric (i.e., "cost-equivalent" realizations).

Published in:

Automatic Control, IEEE Transactions on  (Volume:28 ,  Issue: 5 )