Algorithm for reducing the minimal realization problem of two-dimensional systems to a system of bilinear equations

Document Type

Article

Publication Date

1-1-1992

Abstract

The problem of the minimal state space realization of two-dimensional transfer functions which are not of any special form such as separable, all pole, all zero, continued fraction expandable, etc. is considered. For this general type of transfer function, an algorithm is presented for the minimal state space realization which is computationally superior over known techniques. The proposed algorithm starts by deriving, prior to and independently of the state space vectors b and c and the scalar d, the matrix A of the space model, nearly by inspection. Subsequently, the vectors b and c and the scalar d are determined on the basis of a bilinear algebraic system of equations. © 1992 Taylor & Francis Group, LLC.

Identifier

84946335182 (Scopus)

Publication Title

International Journal of Systems Science

External Full Text Location

https://doi.org/10.1080/00207729208949228

e-ISSN

14645319

ISSN

00207721

First Page

545

Last Page

556

Issue

4

Volume

23

This document is currently not available here.

Share

COinS