We propose a new Kalikow decomposition for continuous-time multivariate counting processes, on potentially infinite networks. We prove the existence of such a decomposition in various cases. This decomposition allows us to derive simulation algorithms that hold either for stationary processes with potentially infinite network but bounded intensities, or for processes with unbounded intensities in a finite network and with empty past before zero. The Kalikow decomposition is not unique, and we discuss the choice of the decomposition in terms of algorithmic efficiency in certain cases. We apply these methods to several examples: the linear Hawkes process, the age-dependent Hawkes process, the exponential Hawkes process, and the Galves–Löcherbach process.

This paper presents the basis of a mathematical model for simulation of planar flexible-link manipulators, taking into consideration the effect of higher stiffness zones at the link tips. The proposed formulation is a variation of the finite segment multi-body dynamics approach. The formulation employs a consistent mass matrix in order to provide better approximation than the traditional lumped masses often encountered in the finite segment approach. The formulation is implemented into a computational code and tested through three examples; cantilever beam, rotating beam and three-link manipulator. In these examples, the length of the rigid tips at both sides of each link ranges from 0% to 6.25% of the whole link length. The zones of higher stiffness at the link tips are treated as short rigid zones. The effect of the rigid zones is averaged along with some portions of the flexible links, thereby allowing further simplification of the dynamic equations of motion. The simulation results demonstrate the effectiveness of the proposed modeling technique and show the importance of not ignoring the effect of the rigid tips.