Determination of perturbation index of a DAE with maximum weighted matching algorithm
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
There are several definitions of the index of a differential algebraic equation (DAE). Based on these definitions, algorithms are derived to calculate and reduce the index. Pantelides (1988) has used the differential index to construct his well known algorithm. We propose to use the perturbation index. This naturally leads to finding the highest power of s of each element in (As+B)/sup /spl minus/1/. These highest powers determine the perturbation index of DAE Ax'+Bx=f(t). With fast graph-oriented algorithms this highest power can be found and, consequently, the perturbation index can be determined.Keywords
This publication has 16 references indexed in Scilit:
- The Design and Analysis of AlgorithmsPublished by Springer Nature ,1992
- The Analysis of Generalized Backward Difference Formula Methods Applied to Hessenberg Form Differential-Algebraic EquationsSIAM Journal on Numerical Analysis, 1991
- Continuous System ModelingPublished by Springer Nature ,1991
- Differential Algebraic Equations, Indices, and Integral Algebraic EquationsSIAM Journal on Numerical Analysis, 1990
- The Numerical Solution of Differential-Algebraic Systems by Runge-Kutta MethodsLecture Notes in Mathematics, 1989
- Differential-Algebraic Equation Index TransformationsSIAM Journal on Scientific and Statistical Computing, 1988
- Numerical Solution of Nonlinear Differential Equations with Algebraic Constraints II: Practical ImplicationsSIAM Journal on Scientific and Statistical Computing, 1986
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956