Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation

AbstractThis paper presents a new algorithm for computing the maximum degree δk (A) of a minor of order k in a matrix pencil A(s) . The problem is of practical significance in the field of numerical analysis and systems control. The algorithm adopts a general framework of ``combinatorial relaxation'' due to Murota. It first solves the weighted bipartite matching problem to obtain an estimate $\hat{\delta}_k(A)$ on δk (A) , and then checks if the estimate is correct, exploiting the optimal dual solution. In case of incorrectness, it modifies the matrix pencil A(s) to improve the estimate $\hat{\delta}_k(A)$ without changing δk(A) .The present algorithm performs this matrix modification by an equivalence transformation with constant matrices, whereas the previous one uses biproper rational function matrices. Thus the present approach saves memory space and reduces the running time bound by a factor of rank A.

[1]  J. Dion,et al.  Structure at infinity of linear multivariable systems a geometric approach , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

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

[3]  C. Pantelides.  The consistent intialization of differential-algebraic systems , 1988 .

[4]  P. Dooren.  The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[5]  J. Dion,et al.  Analysis of linear structured systems using a primal-dual algorithm , 1996 .

[6]  C. W. Gear,et al.  Differential-algebraic equations index transformations , 1988 .

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

[8]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[9]  Iain S. Duff,et al.  Computing the structural index , 1986 .

[10]  室田 一雄.  Systems analysis by graphs and matroids : structural solvability and controllability , 1987 .

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

[12]  室田 一雄,et al.  Matrices and matroids for systems analysis , 2000 .

[13]  Christian Commault,et al.  Disturbance rejection for structured systems , 1991 .

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

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

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

[17]  Pawel Bujakiewicz,et al.  Maximum weighted matching for high index differential algebraic equations , 1994 .

[18]  C. W. Gear,et al.  Differential algebraic equations, indices, and integral algebraic equations , 1990 .

[19]  W. Marquardt,et al.  Structural analysis of differential-algebraic equation systems—theory and applications , 1995 .

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

[21]  K. Murota,et al.  Structure at infinity of structured descriptor systems and its applications , 1991 .

[22]  J. W. van der Woude,et al.  On the structure at infinity of a structured system , 1991 .

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