Minimal realization of transfer function matrices via one orthogonal transformation

The minimal realization of a given arbitrary transfer function matrix G(s) is obtained by applying one orthogonal similarity transformation to the controllable realization of G(s). The similarity transformation is derived by computing the QR or the singular value decomposition of a matrix constructed from the coefficients of G(s). It is emphasized that the procedure has not been proved to be numerically stable. Moreover, the matrix to be decomposed is larger than the matrices factorized during the step-by-step procedures given.<
>