Index Reduction via Unimodular Transformations

This paper presents an algorithm for transforming a matrix pencil $A(s)$ into another matrix pencil $U(s)A(s)$ with a unimodular matrix $U(s)$ so that the resulting Kronecker index is at most one. ...

[1]  Sven Erik Mattsson,et al.  Index Reduction in Differential-Algebraic Equations Using Dummy Derivatives , 1993, SIAM J. Sci. Comput..

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

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

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

[5]  Shun Sato.  Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors , 2015, Algorithmica.

[6]  René Lamour,et al.  Differential-Algebraic Equations: A Projector Based Analysis , 2013 .

[7]  John D. Pryce,et al.  Symbolic-numeric methods for improving structural analysis of differential-algebraic equation systems , 2015, ArXiv.

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

[9]  J. Pryce.  A Simple Structural Analysis Method for DAEs , 2001 .

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

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

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

[13]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[14]  David S. Watkins,et al.  Fundamentals of matrix computations , 1991 .

[15]  Linda R. Petzold,et al.  Numerical solution of initial-value problems in differential-algebraic equations , 1996, Classics in applied mathematics.

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

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

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

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

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

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

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

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

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

[25]  Uri M. Ascher,et al.  Computer methods for ordinary differential equations and differential-algebraic equations , 1998 .

[26]  E. Hairer,et al.  Solving Ordinary Differential Equations I , 1987 .