A uniform algorithm for the transformation of multivariable systems into canonical forms (Q2277544)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A uniform algorithm for the transformation of multivariable systems into canonical forms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A uniform algorithm for the transformation of multivariable systems into canonical forms |
scientific article |
Statements
A uniform algorithm for the transformation of multivariable systems into canonical forms (English)
0 references
1991
0 references
Single-input time-invariant linear systems can be characterized by the matrix equation \((*)\quad \dot x=Ax+\lambda b\), where \(A\) denotes an \(n\times n\) matrix, \(x\) and \(b\) are \(n\times 1\), and \(\lambda\) is a scalar. In many cases, this equation has to be transformed by means of a similarity transformation into a canonical form. The purpose of this paper is to present a uniform treatment of a variety of known canonical forms. In the single-input case, the authors provide a method based on the factorization of the transformation matrix. This can be expressed as the product of the controllability matrix of the system (*) and of a Hessenberg matrix. Extensions of the transformation algorithm to multiple-input systems are also given.
0 references
uniform algorithm
0 references
multivariable systems
0 references
linear dynamical systems
0 references
single-input time-invariant linear systems
0 references
matrix equation
0 references
canonical form
0 references
factorization
0 references
transformation matrix
0 references
controllability matrix
0 references
Hessenberg matrix
0 references
multiple-input systems
0 references
time-invariant
0 references