Robust Control Toolbox | ![]() ![]() |
Inner-outer factorization (row type).
Inner-outer factorization (column type).[ain,,ainp,,aout,] = iofr(c)(a,bcd) [ssin,ssinp,ssout] = iofr(c)(ss)
Description
A square transfer function M(s) is outer if it is proper and stable and has an inverse that is also proper and stable. A transfer function of dimension
m by n is inner if it is stable and satisfies
Iofr
computes an inner-outer factorization for a stable transfer function iofc
computes an inner-outer factorization for the case of m < n via duality by applying iofr
to GT(s), then transposing the result.
Algorithm
iofr
implements the algorithm described in [1], where it is shown that inner-outer factorization relates closely to the standard optimal LQ control problem as follows:
[F,X] = lqr(A,B,Q,R,N) = lqr(A,B,C'*C,D'*D,C'*D).The matrix X-1 is a generalized inverse (e.g., a pseudoinverse). Although X may be singular,
Iofc
applies iofr
to GT(s), then transposes the result.
Limitations
The inner-outer factorization requires the system G(s) to be stable and to have neither poles nor transmission zeros on the j-axis or at
. In particular D must have full column rank for
iofr
or full row rank for iofc
.
References
[1] J. Doyle, Advances in Multivariable Control. Lecture Notes at ONR/Honeywell Workshop. Minneapolis, MN, Oct. 8-10, 1984.
![]() | interc | lftf | ![]() |