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

Mixed polynomial matrices are polynomial matrices with two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. The computation of their maximum degrees of minors is known to be reducible to valuated independent assignment problems, which can be solved by polynomial numbers of additions, subtractions, and multiplications of rational functions. However, these arithmetic operations on rational functions are much more expensive than those on constants. In this paper, we present a new algorithm of combinatorial relaxation type. The algorithm finds a combinatorial estimate of the maximum degree by solving a weighted bipartite matching problem, and checks if the estimate is equal to the true value by solving independent matching problems. The algorithm mainly relies on fast combinatorial algorithms and performs numerical computation only when necessary. In addition, it requires no arithmetic operations on rational functions. As a byproduct, this method yields a new algorithm for solving a linear valuated independent assignment problem.

[1]  Satoru Iwata,et al.  Combinatorial relaxation algorithm for mixed polynomial matrices , 2001, Math. Program..

[2]  K. Murota.  Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability , 1987 .

[3]  Nicholas J. A. Harvey.  Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..

[4]  Piotr Sankowski,et al.  Maximum matchings in planar graphs via gaussian elimination , 2004, Algorithmica.

[5]  Satoru Iwata,et al.  On the Kronecker Canonical Form of Mixed Matrix Pencils , 2011, SIAM J. Matrix Anal. Appl..

[6]  Kazuo Murota,et al.  Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form , 1995, Applicable Algebra in Engineering, Communication and Computing.

[7]  Kazuo Murota,et al.  Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation , 1990, SIAM J. Comput..

[8]  Ying Xu,et al.  Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems , 1996, J. Comput. Syst. Sci..

[9]  James S. Thorp,et al.  The singular pencil of a linear dynamical system , 1973 .

[10]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[11]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[12]  Thomas Kailath,et al.  Rational matrix structure , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[13]  James Demmel,et al.  Accurate solutions of ill-posed problems in control theory , 1988 .

[14]  E. Bareiss.  Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[15]  Satoru Iwata,et al.  Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation , 1999, SODA '99.

[16]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  A. Storjohann.  Algorithms for matrix canonical forms , 2000 .

[18]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[19]  Kazuo Murota,et al.  Systems Analysis by Graphs and Matroids , 1987 .

[20]  Kazuo Murota,et al.  Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..

[21]  Piotr Sankowski,et al.  Maximum weight bipartite matching in matrix multiplication time , 2009, Theor. Comput. Sci..

[22]  Erwin H. Bareiss,et al.  Computational Solutions of Matrix Problems Over an Integral Domain , 1972 .

[23]  Kazuo Murota,et al.  On the Degree of Mixed Polynomial Matrices , 1998, SIAM J. Matrix Anal. Appl..

[24]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[25]  Kazuo Murota,et al.  Valuated Matroid Intersection II: Algorithms , 1996, SIAM J. Discret. Math..

[26]  Kazuo Murota,et al.  Computing the Degree of Determinants Via Combinatorial Relaxation , 1995, SIAM J. Comput..

[27]  M. Iri,et al.  Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— , 1985 .

[28]  Satoru Iwata,et al.  Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants , 1996, SIAM J. Sci. Comput..