Robust Control Toolbox | ![]() ![]() |
Relative error model reduction via Schur balanced stochastic truncation.
[ared,bred,cred,dred,aug,svh] = bstschmr(A,B,C,D,Type) [ared,bred,cred,dred,aug,svh] = bstschmr(A,B,C,D,Type,no) [ared,bred,cred,dred,aug,svh] = bstschmr(A,B,C,D,Type,no,info) [ssred,aug,svh] = bstschmr(SS,Type) [ssred,aug,svh] = bstschmr(SS,Type,no) [ssred,aug,svh] = bstschmr(SS,Type,no,info)The same syntax applies to
"bstschml"
Description
Given an nth order stable plant
bstschmr
computes a kth order reduced model
Type = 1, no =
k, size of reduced order model.
Type = 2, no =
tol, a relative tolerance band in db such that the kth order reduced
model
Type = 3
, display svh
and prompt for k
. In this case, no need to assign a value
for no
.
aug(1,1)
returns the number of states that have been removed, while aug(1,2)
returns the relative error bound.
Bstschml
solves the "dual" problem of bstschmr
with the same error boundbstschmr
and bstschml
via bilinear transform bilin
to get a reduced order
Algorithm
bstschmr
implements the BST model reduction algorithm of [1], but using the Schur method of [4] to bypass the numerical sensitive balancing step. The BST relative error bound is due to Wang and Safonov [6, 9]. The complete algorithm of bstschml
and bstschmr
is presented in [5].
bstschmr
computes the reachability grammian P of G(s) and the observability grammian Q of W(s) via the equationsAred
, Bred
, Cred
, Dred
), will not in general be stochastically balanced.
The BST model reduction procedure produces similar relative error bounds and is closely related to the optimal Hankel norm phase matching model results of [2] and [3].
Bstschml
is completely analogous and simply applies the "dual" BST/REM theory. It can also be called by bstschmr
with an additional input variable info= "left"
.
Limitations
The BST model reduction theory requires that D be full rank, for otherwise the Riccati solver fails. For any problem with strictly proper plant, you can shift the j-axis via
bilin
such that BST/REM approximation can be achieved up to a particular frequency range of interest. Alternatively, you can attach a small but full rank D matrix to the original problem but remove the matrix of the reduced order model afterwards. As long as the size of D matrix is insignificant inside the control bandwidth, the reduced order model should be fairly close to the true model.
See Also
balmr
, mrdemo
, ohklmr
, schmr
References
[1] U. B. Desai and D. Pal, "A Transformation Approach to Stochastic Model Reduction," IEEE Trans. on Automat. Contr., AC-29, 12, 1984.
![]() | branch | cgloci, dcgloci | ![]() |