Computing the maximum degree of minors in matrix pencils via combinatorial relaxation

Algorithmica (New York)

Volumn 36, Issue 4, 2003, Pages 331-341

  Iwata, Satoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Combinatorial relaxation; Determinant; Index of DAE; Matching; Matrix pencil; Strict equivalence transformation

Indexed keywords

BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONTROL SYSTEMS; DIFFERENTIAL EQUATIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; POLYNOMIALS;

COMBINATORIAL RELAXATION; DEGREE OF MINORS; DETERMINANT; DIFFERENTIAL ALGEBRAIC EQUATION; MATRIX PENCILS; STRICT EQUIVALENCE TRANSFORMATION; WEIGHTED BIPARTITE MATCHING;

ALGORITHMS;

EID: 0942290219     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1022-9     Document Type: Article

References (21)

1. P. Bujakiewicz, Maximum Weighted Matching for High Index Differential Algebraic Equations, Doctor Thesis, Delft University of Technology, 1994.
2. C. Commault and J.-M. Dion, Structure at infinity of linear multivariable systems: a geometric approach, IEEE Trans. Automat. Control, AC-27 (1982), 693-696.
3. C. Commault, J.-M. Dion, and A. Perez, Disturbance rejection for structured systems, IEEE Trans. Automat. Control, AC-36 (1991), 884-887.
4. I. Duff and C. W. Gear, Computing the structural index, SIAM J. Algebraic Discrete Methods, 7 (1986), 594-603.
5. F. R. Gantmacher, The Theory of Matrices, Chelsea, New York, 1959.
6. C. W. Gear, Differential-algebraic equation index transformations, SIAM J. Sci. Statist. Comput., 9 (1988), 39-47.
7. C. W. Gear, Differential algebraic equations, indices, and integral algebraic equations, SIAM J. Numer. Anal., 27 (1990), 1527-1534.
8. V. Hovelaque, C. Commault and J.-M. Dion, Analysis of linear structured systems using primal-dual algorithm, Systems Control Lett., 27 (1996), 73-85.
9. S. Iwata and K. Murota, Combinatorial relaxation algorithm for mixed polynomial matrices, Math. Programming, 90 (2001), 353-371.
10. S. Iwata, K. Murota, and I. Sakuta, Primal-dual combinatorial relaxation algorithms for the maximum degree of subdeterminants, SIAM J. Sci. Comput., 17 (1996), 993-1012.
11. K. Murota, Systems Analysis by Graphs and Matroids - Structural Solvability and Controllability, Springer-Verlag, Berlin, 1987.
12. K. Murota, Computing Puiseux-series solutions to determinantal equations via combinatorial relaxation, SIAM J. Comput., 19 (1990), 1132-1161.
13. K. Murota, Computing the degree of determinants via combinatorial relaxation, SIAM J. Comput., 24 (1995), 765-796.
14. K. Murota, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: computing Smith-McMillan form at infinity and structural indices in Kronecker form, Appl. Algebra Engrg. Comm. Comput., 6 (1995), 251-273.
15. K. Murota, On the degree of mixed polynomial matrices, SIAM J. Matrix Anal. Appl., 20 (1999), 196-227.
16. K. Murota, Matrices and Matroids for Systems Analysis, Springer-Verlag, Berlin, 2000.
17. K. Murota and J. W. van der Woude, Structure at infinity of structured descriptor systems and its applications, SIAM J. Control Optim., 29 (1991), 878-894.
18. C. C. Pantelides, The consistent initialization of differential-algebraic systems, SIAM J. Sci. Statist. Comput., 9 (1988), 213-231.
19. J. Ungar, A. Kröner, and W. Marquardt, Structural analysis of differential-algebraic equation systems - theory and application, Comput. Chem. Engrg., 19 (1995), 867-882.
20. J. W. van der Woude, On the structure at infinity of a structured system, Linear Algebra Appl., 148 (1991), 145-169.
21. P. Van Dooren, The computation of Kronecker's canonical form of a singular pencil, Linear Algebra Appl., 27 (1979), 103-140.