Basins of attraction in nonsmooth models of gear rattle

This paper is concerned with the computation of the basins of attraction of a simple one degree-of-freedom backlash oscillator using cell-to-cell mapping techniques. This analysis is motivated by the modeling of order vibration in geared systems. We consider both a piecewise-linear stiffness model and a simpler infinite stiffness impacting limit. The basins reveal rich and delicate dynamics, and we analyze some of the transitions in the system's behavior in terms of smooth and discontinuity-induced bifurcations. The stretching and folding of phase space are illustrated via computations of the grazing curve, and its preimages, and manifold computations of basin boundaries using DsTool (Dynamical Systems Toolkit)

Turchin's Relation for Call-by-Name Computations: A Formal Approach

Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name semantics to terminate unfolding of the program being transformed. In this paper, we give a formal grammar model of call-by-name stack behaviour. We classify the model in terms of the Chomsky hierarchy and then formally prove that Turchin's relation can terminate all computations generated by the model.Comment: In Proceedings VPT 2016, arXiv:1607.0183