Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices

DOI10.14495/jsiaml.7.49OpenAlexW849556615MaRDI QIDQ3121390

Shun Sato

Publication date: 18 March 2019

Published in: JSIAM Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14495/jsiaml.7.49

zbMATH Keywords

combinatorial relaxationdegree of minordiscrete concavityvaluated bimatroidmixed matrix

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items (3)

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors

Cites Work

• Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
• Finding optimal minors of valuated bimatroids
• 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
• On some techniques useful for solution of transportation network problems
• Matrices and matroids for systems analysis

This page was built for publication: Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices