Row completion of polynomial and rational matrices
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 49560 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3217623 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Finite and infinite structures of rational matrices: a local approach
- Imbedding conditions for \(\lambda\)-matrices
- Interlacing inequalities for invariant factors
- Interlacing inequalities for regular pencils
- Matrix polynomials with completely prescribed eigenstructure
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- On convexity of polynomial paths and generalized majorizations
- Row or Column Completion of Polynomial Matrices of Given Degree
- Row or column completion of polynomial matrices of given degree. II
- Spectral equivalence of matrix polynomials and the index sum theorem
- The General Matrix Pencil Completion Problem: A Minimal Case
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Van Dooren's index sum theorem and rational matrices with prescribed structural data
This page was built for publication: Row completion of polynomial and rational matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973052)