On the Degree of Mixed Polynomial Matrices
From MaRDI portal
Publication:4243501
DOI10.1137/S0895479896311438zbMath0956.05068MaRDI QIDQ4243501
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (7)
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils ⋮ 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 ⋮ Extension of M-convexity and L-convexity to polyhedral convex functions ⋮ Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices ⋮ On impulsive algebraic multiplicities of linear time-invariant singular systems under feedback
This page was built for publication: On the Degree of Mixed Polynomial Matrices