On the Degree of Mixed Polynomial Matrices
From MaRDI portal
Publication:4243501
Recommendations
- Computing the degrees of all cofactors in mixed polynomial matrices
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Combinatorial relaxation algorithm for mixed polynomial matrices
Cited in
(12)- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Legendre duality in combinatorial study of matrix pencils
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
- Computing the degrees of all cofactors in mixed polynomial matrices
- scientific article; zbMATH DE number 3630952 (Why is no real title available?)
- Finding optimal minors of valuated bimatroids
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
- Computing valuations of the Dieudonné determinants
- On impulsive algebraic multiplicities of linear time-invariant singular systems under feedback
- Extension of M-convexity and L-convexity to polyhedral convex functions
- On realizations of a joint degree matrix
This page was built for publication: On the Degree of Mixed Polynomial Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243501)