On the Kronecker Canonical Form of Mixed Matrix Pencils

A mixed matrix pencil is a matrix pencil with two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. In this paper, the indices of nilpotency of the Kronecker canonical form for a mixed matrix pencil are characterized in terms of matroids. As a byproduct, this provides an algorithm for computing the rank of a power product of a square mixed matrix.

[1]  Ricardo Riaza,et al.  Differential-Algebraic Systems: Analytical Aspects and Circuit Applications , 2008 .

[2]  William H Cunningham,et al.  Improved Bounds for Matroid Partition and Intersection Algorithms , 1986, SIAM J. Comput..

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

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

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

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

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

[8]  Alexander Schrijver,et al.  Matroids and linking systems , 1979, J. Comb. Theory, Ser. B.

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

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

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

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

[13]  Volker Mehrmann,et al.  Differential-Algebraic Equations: Analysis and Numerical Solution , 2006 .

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

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

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

[17]  Dominic Welsh,et al.  On Matroid Theorems of Edmonds and Rado , 1970 .

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

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

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

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

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

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

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

[25]  SATORU IWATA,et al.  Combinatorial Analysis of Singular Matrix Pencils , 2007, SIAM J. Matrix Anal. Appl..

[26]  Joseph P. S. Kung,et al.  Bimatroids and invariants , 1978 .