Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation

DOI10.1137/0219077zbMath0711.68066OpenAlexW2062358873MaRDI QIDQ3495659

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219077

zbMATH Keywords

combinatorial optimization computer algebra convex hull Newton diagram parametric assignment problem Puiseux-series expansion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (16)

Non-archimedean valuations of eigenvalues of matrix polynomials ⋮ Index Reduction via Unimodular Transformations ⋮ An identity for bipartite matching and symmetric determinant ⋮ Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form ⋮ A hybrid asymptotic and augmented compact finite volume method for nonlinear singular two point boundary value problems ⋮ A hybrid augmented compact finite volume method for the Thomas-Fermi equation ⋮ High order hybrid asymptotic augmented finite volume methods for nonlinear degenerate wave equations ⋮ Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation ⋮ On matrix perturbations with minimal leading Jordan structure. ⋮ 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 ⋮ Semi-decoupling hybrid asymptotic and augmented finite volume method for nonlinear singular interface problems ⋮ The high order augmented finite volume methods based on series expansion for nonlinear degenerate parabolic equations ⋮ An identity for matching and skew-symmetric determinant ⋮ 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

This page was built for publication: Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation