Minimal bases of matrix pencils and coprime matrix fraction descriptions (Q3148248)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1810424
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimal bases of matrix pencils and coprime matrix fraction descriptions
    scientific article; zbMATH DE number 1810424

      Statements

      Minimal bases of matrix pencils and coprime matrix fraction descriptions (English)
      0 references
      20 August 2003
      0 references
      minimal base
      0 references
      coprime factorization
      0 references
      matrix pencil
      0 references
      0 references
      0 references
      There are four main approaches that have emerged so far for the construction of a coprime matrix fraction description (MFD) of a proper rational matrix: (a) a method defined by Rosenbrock, (b) the reduction to the block Hessenberg form (BHF) or the block Frobenious form (BFF), (c) the minimal design problem (MDP), and (d) a method defined by Wolovich. In this very interesting work, the authors propose two theoretical computational procedures for coprime MFDs, starting from a minimal state space description. The authors, based on the results presented in [the author, Linear Algebra Appl. 205-206, 831--868 (1994; Zbl 0804.15008)] for the evaluation of minimal bases of the kernels of matrix pencils, produce two simpler procedures for determining coprime MFDs. The first of the approaches is referred to as indirect and is based on the restriction pencil (sN-NA) [the author, Matrix pencil approach to geometric system theory, Proc. IEE, 126, 585--590 (1979)] and exploits the Toeplitz structure of the minimal bases of this pencil. The second method is referred to as direct and, although it is also based on the properties of minimal bases of the matrix pencil (\(sI\)-\(A\) \(B\)), it reduces computations to kernel problem evaluations of partial controllability matrices. Finally, the paper deals with numerical aspects relating to their implementation. Since the appearing matrices possess a special Toeplitz structure, the development of efficient numerical algorithms exploiting this structure is an issue deserving further investigation. Following also similar lines to the ones presented in this work, the nonproper case may also be investigated in a further work.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references