Combinatorial relaxation algorithm for mixed polynomial matrices

DOI10.1007/PL00011427MaRDI QIDQ5935713zbMATH OpenFDO

Authors Satoru Iwata, Kazuo Murota

Publication date 26 June 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00011427

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27)

Recommendations

• 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 the entire sequence of the maximum degree of minors
• Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
• Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants

Cited in

(6)

• 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 Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
• On the Degree of Mixed Polynomial Matrices
• scientific article; zbMATH DE number 7125122 (Why is no real title available?)
• Legendre duality in combinatorial study of matrix pencils

This page was built for publication: Combinatorial relaxation algorithm for mixed polynomial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935713)