Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation

DOI10.1007/978-3-642-20807-2_22zbMath1343.65040OpenAlexW1636771208MaRDI QIDQ3009769

Satoru Iwata, Mizuyo Takamatsu

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_22

zbMATH Keywords

matching problemassignment problemKronecker canonical formpolynomial matrixmatrix pencilcombinatorial relaxation algorithmmaximum degree of minors

Mathematics Subject Classification ID

Related Items (1)

Legendre duality in combinatorial study of matrix pencils

Cites Work

• Unnamed Item
• Maximum weight bipartite matching in matrix multiplication time
• Systems analysis by graphs and matroids. Structural solvability and controllability
• On fast multiplication of polynomials over arbitrary algebras
• Valuated matroids
• Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
• Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
• Maximum matchings in planar graphs via Gaussian elimination
• On the Kronecker Canonical Form of Mixed Matrix Pencils
• Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
• Algebraic Algorithms for Matching and Matroid Problems
• Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
• Rational matrix structure
• On the Degree of Mixed Polynomial Matrices
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated Matroid Intersection II: Algorithms
• Computing the Degree of Determinants via Combinatorial Relaxation
• Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
• Algorithms – ESA 2004
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Computational Solutions of Matrix Problems Over an Integral Domain
• The singular pencil of a linear dynamical system†
• Matrices and matroids for systems analysis
• Combinatorial relaxation algorithm for mixed polynomial matrices

This page was built for publication: Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation