On the Degree of Mixed Polynomial Matrices
From MaRDI portal
Publication:4243501
DOI10.1137/S0895479896311438zbMATH Open0956.05068MaRDI QIDQ4243501FDOQ4243501
Authors: Kazuo Murota
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27)
Cited In (11)
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Legendre duality in combinatorial study of matrix pencils
- Finding optimal minors of valuated bimatroids
- 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
- Computing the degrees of all cofactors in mixed polynomial matrices
- 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
- On realizations of a joint degree matrix
- Title not available (Why is that?)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
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)