Constraint partitioning in dynamic iteration methods

Dynamic iteration (waveform relaxation) is a well approved approach to the numerical solution of coupled instationary differential equations that is b ased on a splitting into several subsystems. If the subsystems are coupled by constraints then there is no generic way to assign these constraints to the subsystems. In the present paper we consider three partitioning strateg ies for constraints that couple two differential-algebraic systems. An erro r analysis shows that the stability of the dynamic iteration method depends strongly on the partitioning of the constraints.