Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
From MaRDI portal
Publication:1950387
DOI10.1007/s00453-012-9640-8zbMath1284.65059OpenAlexW2785187072MaRDI QIDQ1950387
Mizuyo Takamatsu, Satoru Iwata
Publication date: 13 May 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9640-8
matching problemassignment problemKronecker canonical formpolynomial matrixmatrix pencilcombinatorial relaxation algorithmmaximum degree of minors
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
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 ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
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
- Efficient theoretic and practical algorithms for linear matroid intersection problems
- 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—
- Accurate Solutions of Ill-Posed Problems in control theory
- 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
