A uniform algorithm for the transformation of multivariable systems into canonical forms

DOI10.1016/0024-3795(91)90242-OMaRDI QIDQ2277544zbMATH OpenOpenAlexFDO

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90242-o

canonical form controllability matrix factorization Hessenberg matrix linear dynamical systems matrix equation multiple-input systems multivariable systems single-input time-invariant linear systems time-invariant transformation matrix uniform algorithm

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Factorization of matrices (15A23) Controllability (93B05) Control/observation systems governed by ordinary differential equations (93C15) Model systems in control theory (93C99)

Review text

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.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: A uniform algorithm for the transformation of multivariable systems into canonical forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277544)