Algorithm for model reduction of 2-D discrete time systems

Kamal Premaratne, E. I. Jury, Mohamed Mansour

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

In the context of model reduction of 2-D discrete time systems, several important properties of 2-D Gramians and balanced realizations are presented. Through a counterexample, the conjecture that the reduced model preserves stability is proven invalid. For separable systems, several interesting results regarding Gramians, norms, stability, and minimality are presented. For nonseparable systems, a simple, more efficient technique to compute Gramians is provided. The computation of Gramians in the separable case is possible through the solution of two pairs of discrete Lyapunov equations. An example is given to illustrate and justify the notions presented.

Original languageEnglish
Pages (from-to)1116-1132
Number of pages17
JournalIEEE Transactions on Circuits and Systems
Volume37
Issue number9
DOIs
StatePublished - Sep 1 1990

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Algorithm for model reduction of 2-D discrete time systems. / Premaratne, Kamal; Jury, E. I.; Mansour, Mohamed.

In: IEEE Transactions on Circuits and Systems, Vol. 37, No. 9, 01.09.1990, p. 1116-1132.

Research output: Contribution to journalArticle

Premaratne, Kamal ; Jury, E. I. ; Mansour, Mohamed. / Algorithm for model reduction of 2-D discrete time systems. In: IEEE Transactions on Circuits and Systems. 1990 ; Vol. 37, No. 9. pp. 1116-1132.
@article{87c7d8aa1bfc4ea5ad9931500f03b7be,
title = "Algorithm for model reduction of 2-D discrete time systems",
abstract = "In the context of model reduction of 2-D discrete time systems, several important properties of 2-D Gramians and balanced realizations are presented. Through a counterexample, the conjecture that the reduced model preserves stability is proven invalid. For separable systems, several interesting results regarding Gramians, norms, stability, and minimality are presented. For nonseparable systems, a simple, more efficient technique to compute Gramians is provided. The computation of Gramians in the separable case is possible through the solution of two pairs of discrete Lyapunov equations. An example is given to illustrate and justify the notions presented.",
author = "Kamal Premaratne and Jury, {E. I.} and Mohamed Mansour",
year = "1990",
month = "9",
day = "1",
doi = "10.1109/31.57600",
language = "English",
volume = "37",
pages = "1116--1132",
journal = "IEEE Transactions on Circuits and Systems",
issn = "0098-4094",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Algorithm for model reduction of 2-D discrete time systems

AU - Premaratne, Kamal

AU - Jury, E. I.

AU - Mansour, Mohamed

PY - 1990/9/1

Y1 - 1990/9/1

N2 - In the context of model reduction of 2-D discrete time systems, several important properties of 2-D Gramians and balanced realizations are presented. Through a counterexample, the conjecture that the reduced model preserves stability is proven invalid. For separable systems, several interesting results regarding Gramians, norms, stability, and minimality are presented. For nonseparable systems, a simple, more efficient technique to compute Gramians is provided. The computation of Gramians in the separable case is possible through the solution of two pairs of discrete Lyapunov equations. An example is given to illustrate and justify the notions presented.

AB - In the context of model reduction of 2-D discrete time systems, several important properties of 2-D Gramians and balanced realizations are presented. Through a counterexample, the conjecture that the reduced model preserves stability is proven invalid. For separable systems, several interesting results regarding Gramians, norms, stability, and minimality are presented. For nonseparable systems, a simple, more efficient technique to compute Gramians is provided. The computation of Gramians in the separable case is possible through the solution of two pairs of discrete Lyapunov equations. An example is given to illustrate and justify the notions presented.

UR - http://www.scopus.com/inward/record.url?scp=0025482287&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025482287&partnerID=8YFLogxK

U2 - 10.1109/31.57600

DO - 10.1109/31.57600

M3 - Article

AN - SCOPUS:0025482287

VL - 37

SP - 1116

EP - 1132

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

SN - 0098-4094

IS - 9

ER -