Combinatorial Analysis of Generic Matrix Pencils

This paper investigates the Kronecker canonical form of matrix pencils under the genericity assumption that the set of nonzero entries is algebraically independent. We provide a combinatorial characterization of the sums of the row/column indices supported by efficient bipartite matching algorithms. We also give a simple alternative proof for a theorem of Poljak on the generic ranks of matrix powers.

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

[2]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[3]  Erik Elmroth,et al.  A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations , 1997 .

[4]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[5]  Erik Elmroth,et al.  A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations , 1997, SIAM J. Matrix Anal. Appl..

[6]  J. W. van der Woude.  The generic canonical form of a regular structured matrix pencil , 2002 .

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

[8]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

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

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

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  James Hardy Wilkinson,et al.  Kronecker''s canonical form and the QZ algorithm , 1979 .

[13]  James Demmel,et al.  The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I: theory and algorithms , 1993, TOMS.

[14]  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.

[15]  B. Molinari.  Structural invariants of linear multivariable systems , 1978 .

[16]  James Demmel,et al.  The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II: software and applications , 1993, TOMS.

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

[18]  P. Dooren,et al.  An improved algorithm for the computation of Kronecker's canonical form of a singular pencil , 1988 .

[19]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[20]  H. Rosenbrock,et al.  State-space and multivariable theory, , 1970 .

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

[22]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.

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

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

[25]  Bo Kågström,et al.  RGSD an algorithm for computing the Kronecker structure and reducing subspaces of singular A-lB pencils , 1986 .

[26]  S. Poljak.  Maximum rank of powers of a matrix of a given pattern , 1989 .

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

[28]  Kazuo Murota,et al.  On the Smith normal form of structured polynomial matrices , 1991 .

[29]  C. W. Gear,et al.  Differential-Algebraic Equations , 1984 .

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

[31]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[32]  室田 一雄,et al.  Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants , 1995 .

[33]  N. S. Mendelsohn,et al.  Two Algorithms for Bipartite Graphs , 1963 .

[34]  V. Kublanovskaya.  AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices , 1984 .

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