Null-space computation for qLPV systems

Z. Szabó, T. Péni, J. Bokor

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Computation of the nullspace of a quasi linear parameter varying system (qLPV) bears significant importance in several fields of control theory, such as fault detection design or reconfigurable control design. While for linear time invariant systems computation of the stable nullspaces can be efficiently handled based on matrix pencil techniques, for more general cases, such as qLPV systems, such algorithms are not available. The paper provides a general scheme for the construction of the stable nullspaces that can be followed not only for dynamic (LTI, LTV, qLPV) systems but also in the case of memoryless, parameter varying matrices. The reliability of the proposed method for practical computations is also discussed. The algorithm is illustrated through small examples.

Original languageEnglish
Pages (from-to)170-175
Number of pages6
JournalIFAC-PapersOnLine
Volume48
Issue number26
DOIs
Publication statusPublished - 2015

Fingerprint

Control theory
Fault detection

Keywords

  • LPV systems
  • Nullspace computation
  • QLPV systems

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Null-space computation for qLPV systems. / Szabó, Z.; Péni, T.; Bokor, J.

In: IFAC-PapersOnLine, Vol. 48, No. 26, 2015, p. 170-175.

Research output: Contribution to journalArticle

Szabó, Z. ; Péni, T. ; Bokor, J. / Null-space computation for qLPV systems. In: IFAC-PapersOnLine. 2015 ; Vol. 48, No. 26. pp. 170-175.
@article{2786014466864fd69780a8bfde3f6006,
title = "Null-space computation for qLPV systems",
abstract = "Computation of the nullspace of a quasi linear parameter varying system (qLPV) bears significant importance in several fields of control theory, such as fault detection design or reconfigurable control design. While for linear time invariant systems computation of the stable nullspaces can be efficiently handled based on matrix pencil techniques, for more general cases, such as qLPV systems, such algorithms are not available. The paper provides a general scheme for the construction of the stable nullspaces that can be followed not only for dynamic (LTI, LTV, qLPV) systems but also in the case of memoryless, parameter varying matrices. The reliability of the proposed method for practical computations is also discussed. The algorithm is illustrated through small examples.",
keywords = "LPV systems, Nullspace computation, QLPV systems",
author = "Z. Szab{\'o} and T. P{\'e}ni and J. Bokor",
year = "2015",
doi = "10.1016/j.ifacol.2015.11.132",
language = "English",
volume = "48",
pages = "170--175",
journal = "IFAC-PapersOnLine",
issn = "2405-8963",
publisher = "IFAC Secretariat",
number = "26",

}

TY - JOUR

T1 - Null-space computation for qLPV systems

AU - Szabó, Z.

AU - Péni, T.

AU - Bokor, J.

PY - 2015

Y1 - 2015

N2 - Computation of the nullspace of a quasi linear parameter varying system (qLPV) bears significant importance in several fields of control theory, such as fault detection design or reconfigurable control design. While for linear time invariant systems computation of the stable nullspaces can be efficiently handled based on matrix pencil techniques, for more general cases, such as qLPV systems, such algorithms are not available. The paper provides a general scheme for the construction of the stable nullspaces that can be followed not only for dynamic (LTI, LTV, qLPV) systems but also in the case of memoryless, parameter varying matrices. The reliability of the proposed method for practical computations is also discussed. The algorithm is illustrated through small examples.

AB - Computation of the nullspace of a quasi linear parameter varying system (qLPV) bears significant importance in several fields of control theory, such as fault detection design or reconfigurable control design. While for linear time invariant systems computation of the stable nullspaces can be efficiently handled based on matrix pencil techniques, for more general cases, such as qLPV systems, such algorithms are not available. The paper provides a general scheme for the construction of the stable nullspaces that can be followed not only for dynamic (LTI, LTV, qLPV) systems but also in the case of memoryless, parameter varying matrices. The reliability of the proposed method for practical computations is also discussed. The algorithm is illustrated through small examples.

KW - LPV systems

KW - Nullspace computation

KW - QLPV systems

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

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

U2 - 10.1016/j.ifacol.2015.11.132

DO - 10.1016/j.ifacol.2015.11.132

M3 - Article

AN - SCOPUS:84983103420

VL - 48

SP - 170

EP - 175

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8963

IS - 26

ER -