On the number of invariant factors of partially prescribed matrices and control theory
Estimations of the number of invariant factors of partially prescribed matrices are given for different partitions of these matrices. For two matrices \(A\) and \(B\) over an infinite field \(F\), \(i[A B]\) denotes the number of invariant factors of the polynomial matrix \([xI-A-B]\) different from 1; similarly \(i{A\brack C}\) denotes the same number for the matrix \({xI-A\brack -C}\). Six theorems characterize the number of these invariant factors for different partitions of the matrix \([AB]\) with some prescribed submatrices. For instance, Theorem 11 which summarizes these results, states that given \(E_{11}\in F^{p\times p'}\), \(E_{12}\in F^{p\times q'}\), \(E_{21} \in F^{q\times p'}\) with \(p+q=m\), \(p'+q'=m+u\), \(u\geq 0\), and \(\nu\in \{0,1, \dots,m\}\), there exists \(E_{22}\in F^{q\times q'}\) such that \(i[ \begin{smallmatrix} E_{11} & E_{12}\\ E_{21} & E_{22}\end{smallmatrix}]\leq \nu\) iff the following conditions are satisfied: a) \(\nu>0\) or \(u>0\), b) \(\max\{i [E_{11} E_{12}]\), \(i{E_{11}\brack E_{21}}-w\}\leq\nu\) where \(w=\min \{q',u\}\). Since a linear control system \((A,B)\in \mathbb{C}^{n\times n}\times \mathbb{C}^{n\times m}\) is completely controllable iff \(i[A B]=0\), it is emphasized that these results can be used in order to characterize the complete controllability of a system with an unknown submatrix of \([A B]\).
- Column completion of a pair of matrices
- Controllability by completions of partial upper triangular matrices
- Eigenvalues of completions of submatrices
- Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
- scientific article; zbMATH DE number 4179559 (Why is no real title available?)
- scientific article; zbMATH DE number 3472240 (Why is no real title available?)
- Imbedding conditions for \(\lambda\)-matrices
- Interlacing inequalities for invariant factors
- Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
- Matrices with prescribed eigenvalues and blocks
- Matrices with prescribed eigenvalues and principal submatrices
- Matrices with prescribed invariant factors and off-diagonal submatrices
- Matrices with prescribed rows and invariant factors
- Matrices with prescribed submatrices
- Matrices with prescribed submatrices and number of invariant polynomials
- On controllability of partially prescribed matrices
- On structural controllability theorem
- On the number of invariant polynomials of partially prescribed matrices
- Partially specified matrices and operators: classification, completion, applications
- Similarity invariants of completions of submatrices
- Structural controllability
- Structural controllability of multiinput linear systems
- Systems analysis by graphs and matroids. Structural solvability and controllability
- The number of invariant polynomials of a matrix with prescribed complementary submatrices
- Interlacing inequalities and control theory
- Geometric multiplicity margin for a submatrix
- Matrices with prescribed submatrices and number of invariant polynomials
- Cyclic dimensions, controllability subspaces and Gohberg-Kaashoek numbers
- Completely controllable pairs of matrices with prescribed positions
- Controllability of pairs of matrices with prescribed entries
- Characteristic polynomials and controllability of partially prescribed matrices
- Controllability of partially prescribed matrices
- On the existence of linear systems with prescribed invariants for system similarity
This page was built for publication: On the number of invariant factors of partially prescribed matrices and control theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567540)