Matrix pencils completion problems
The paper deals with matrix pencils completion problems. In general, this problem consists in the study of possible Kronecker invariants of a matrix pencil (i.e. its strict equivalence class), when a subpencil is prescribed. Specifically, the author studies and solves the following problem: Let \(F\) be a field. Let \(A(\lambda) \in F[\lambda]^{(n+p) \times (n+l+m)}\) be a matrix pencil. Give necessary and sufficient conditions for the existence of a matrix pencil \(X(\lambda) \in F[\lambda]^{l \times (n+l+m)}\), such that the matrix pencil \[ M(\lambda)= \left[ \frac{A(\lambda)}{X(\lambda)} \right] \in F[\lambda]^{(n+p+l) \times (n+l+m)} \] has a prescribed strict equivalence class. By using a technical result (Lemma 9 of the paper), the author splits the above problem into two less general ones. In order to give a complete solution of the problem, she first solves it in the case when both pencils \(A(\lambda)\) and \(M(\lambda)\) do not have row (column) minimal indices as Kronecker invariants. These results are unified and the complete solution to above problem is given. In the main result, the author obtains a list of necessary and sufficient conditions that guarantee the existence of a matrix pencil \(X(\lambda)\) such that \(M(\lambda)\) has a prescribed homogeneous invariants factors, row and column minimal indices.
- Matrix pencils completion problems. II
- The General Matrix Pencil Completion Problem: A Minimal Case
- Explicit solution of the row completion problem for matrix pencils
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Some remarks on matrix pencil completion problems.
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Column completion of a pair of matrices
- Eigenvalues of completions of submatrices
- Eigenvalues, invariant factors, highest weights, and Schubert calculus
- Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
- Feedback invariants of a pair of matrices with prescribed columns
- Feedback invariants of matrices with prescribed rows
- Feedback invariants via output injection
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 3472240 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- Imbedding conditions for \(\lambda\)-matrices
- Interlacing inequalities and control theory
- Interlacing inequalities for invariant factors
- Interlacing inequalities for regular pencils
- Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
- Matrices with prescribed characteristic polynomial and principal blocks
- Matrices with prescribed characteristic polynomial and principal blocks. II
- Matrices with prescribed eigenvalues and blocks
- Matrices with prescribed eigenvalues and principal submatrices
- Matrices with prescribed invariant factors
- Matrices with prescribed rows and invariant factors
- On the characteristic polynomial of matrices with prescribed rows
- Similarity invariants of completions of submatrices
- Sur la réduction canonique des couples de matrices
- Unified theorems on completions of matrix pencils
- Unified theorems on completions of matrix pencils
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
- Minimal completion problem for quasi-regular matrix pencils
- Pencils with prescribed constant subpencils over arbitrary fields
- Completion of quasi-regular matrix pencils
- Pole placement problem for singular systems.
- Combinatorics of column minimal indices and matrix pencil completion problems
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- On Wilkinson's problem for matrix pencils
- Similarity class of a matrix with a prescribed submatrix
- Pencils with prescribed constant subpencils
- The General Matrix Pencil Completion Problem: A Minimal Case
- GMPCP for one row and one column completion
- Some remarks on matrix pencil completion problems.
- Rank one perturbations of matrix pencils
- Completion of matrix pencils with a single rank restriction
- Row or Column Completion of Polynomial Matrices of Given Degree
- Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
- Row or column completion of polynomial matrices of given degree. II
- Singular systems, state feedback problem
- Explicit solution of the row completion problem for matrix pencils
- Matrix pencils completion problems. II
This page was built for publication: Matrix pencils completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463618)
