Constraint partitioning for structure in path-constrained dynamic optimization problems (Q5948562)

This paper presents an algorithm for automatically detecting a high index differential algebraic equation and extracting the largest lower index (1 or 2) subsystem which can then be solved by extant software. The algorithm works by considering one constraint at a time and uses automatic differentiation techniques to compute local Jacobians. Numerical applications from electronic circuits, motion of a crane and partial differential algebraic equations are considered.