Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bareiss, E.H.: Sylvester’s identity and multistep integer-preserving Gaussian elimination. Mathematics of Computation 22, 565–578 (1968)
Bareiss, E.H.: Computational solutions of matrix problems over an integral domain. IMA Journal of Applied Mathematics 10, 68–104 (1972)
Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28, 693–701 (1991)
Dress, A.W.M., Wenzel, W.: Valuated matroids. Advances in Mathematics 93, 214–250 (1992)
Gantmacher, F.R.: The Theory of Matrices. Chelsea, New York (1959)
Harvey, N.J.A.: Algebraic algorithms for matching and matroid problems. SIAM Journal on Computing 39, 679–702 (2009)
Iwata, S.: Computing the maximum degree of minors in matrix pencils via combinatorial relaxation. Algorithmica 36, 331–341 (2003)
Iwata, S., Murota, K.: Combinatorial relaxation algorithm for mixed polynomial matrices. Mathematical Programming 90, 353–371 (2001)
Iwata, S., Murota, K., Sakuta, I.: Primal-dual combinatorial relaxation algorithms for the maximum degree of subdeterminants. SIAM Journal on Scientific Computing 17, 993–1012 (1996)
Iwata, S., Takamatsu, M.: On the Kronecker canonical form of mixed matrix pencils. SIAM Journal on Matrix Analysis and Applications 32, 44–71 (2011)
Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 248–255. IEEE Computer Society, Los Alamitos (2004)
Mucha, M., Sankowski, P.: Maximum matchings in planar graphs via Gaussian elimination. Algorithmica 45, 3–20 (2006)
Murota, K.: Systems Analysis by Graphs and Matroids — Structural Solvability and Controllability. Springer, Berlin (1987)
Murota, K.: Computing Puiseux-series solutions to determinantal equations via combinatorial relaxation. SIAM Journal on Computing 19, 1132–1161 (1990)
Murota, K.: Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form. Applicable Algebra in Engineering, Communication and Computing 6, 251–273 (1995)
Murota, K.: Computing the degree of determinants via combinatorial relaxation. SIAM Journal on Computing 24, 765–796 (1995)
Murota, K.: Valuated matroid intersection, I: Optimality criteria. SIAM Journal on Discrete Mathematics 9, 545–561 (1996)
Murota, K.: Valuated matroid intersection, II: Algorithms. SIAM Journal on Discrete Mathematics 9, 562–576 (1996)
Murota, K.: On the degree of mixed polynomial matrices. SIAM Journal on Matrix Analysis and Applications 20, 196–227 (1999)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Murota, K., Iri, M.: Structural solvability of systems of equations — A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems. Japan Journal of Applied Mathematics 2, 247–271 (1985)
Sankowski, P.: Maximum weight bipartite matching in matrix multiplication time. Theoretical Computer Science 410, 4480–4488 (2009)
Storjohann, A.: Algorithms for Matrix Canonical Forms. Ph.D. thesis, ETH Zürich (2000)
Thorp, J.S.: The singular pencil of a linear dynamical system. International Journal of Control 18, 577–596 (1973)
Verghese, G.C., Kailath, T.: Rational matrix structure. IEEE Transactions on Automatic Control AC-26, 434–439 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwata, S., Takamatsu, M. (2011). Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)