Index Reduction via Unimodular Transformations
DOI10.1137/17M111794XzbMath1393.65005WikidataQ129576784 ScholiaQ129576784MaRDI QIDQ3176353
Mizuyo Takamatsu, Satoru Iwata
Publication date: 20 July 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
differential-algebraic equationbipartite matchingmatrix pencilindex reductioncombinatorial relaxation
Implicit ordinary differential equations, differential-algebraic equations (34A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical methods for differential-algebraic equations (65L80) Matrix pencils (15A22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential-algebraic equations. A projector based analysis
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
- The computation of Kronecker's canonical form of a singular pencil
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- Symbolic-Numeric Methods for Improving Structural Analysis of Differential-Algebraic Equation Systems
- Algorithms for the Assignment and Transportation Problems
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
- The Consistent Initialization of Differential-Algebraic Systems
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Index Reduction in Differential-Algebraic Equations Using Dummy Derivatives
- Computing the Degree of Determinants via Combinatorial Relaxation
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
- On some techniques useful for solution of transportation network problems
- Matrices and matroids for systems analysis
- A simple structural analysis method for DAEs
This page was built for publication: Index Reduction via Unimodular Transformations
