ALGORITHM FOR REDUCING THE MINIMAL-REALIZATION PROBLEM OF 2-DIMENSIONAL SYSTEMS TO A SYSTEM OF BILINEAR EQUATIONS

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1992 (EN)

ALGORITHM FOR REDUCING THE MINIMAL-REALIZATION PROBLEM OF 2-DIMENSIONAL SYSTEMS TO A SYSTEM OF BILINEAR EQUATIONS (EN)

PARASKEVOPOULOS, PN (EN)
ANTONIOU, GE (EN)

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. (EN)

journalArticle (EN)

Operations Research & Management Science (EN)
STATE-SPACE REALIZATION (EN)
MODELS (EN)
FILTERS (EN)
Automation & Control Systems (EN)
Computer Science, Theory & Methods (EN)
2-D SYSTEMS (EN)
Minimal Realization (EN)


INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE (EN)

English

1992 (EN)

ISI:A1992HU42600007 (EN)
23 (EN)
10.1080/00207729208949228 (EN)
4 (EN)
545 (EN)
556 (EN)
0020-7721 (EN)

TAYLOR & FRANCIS LTD (EN)




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)