Explicit and Implicit Cosimulation Methods: Stability and Convergence Analysis for Different Solver Coupling Approaches

Abstract

The numerical stability and the convergence behavior of cosimulation methods are analyzed in this manuscript. We investigate explicit and implicit coupling schemes with different approximation orders and discuss three decomposition techniques, namely, force/force, force/displacement, and displacement/displacementdecomposition. Here, we only consider cosimulation methods where the coupling is realized by applied forces/torques, i.e., the case that the coupling between the subsystems is described by constitutive laws. Solver coupling with algebraic constraint equations is not investigated. For the stability analysis, a test model has to be defined. Following the stability definition for numerical time integration schemes (Dahlquist's stability theory), a linear test model is used. The cosimulation test model applied here is a twomass oscillator, which may be interpreted as two Dahlquist equations coupled by a linear spring/damper system. Discretizing the test model with a cosimulation method, recurrence equations can be derived, which describe the time discrete cosimulation solution. The stability of the recurrence equations system represents the numerical stability of the cosimulation approach and can easily be determined by an eigenvalue analysis.