Abstract

We will present a robust algorithm to compute the rotation number of a degree one map that has a constant section. The inputs are the interval in which the function is constant and the maximum number of iterates.

We will show how the algorithm performs against some other algorithms used for maps that fall under the same hypothesis. Finally we will plot the Arnol'd Tongues and rotation intervals for a variety of functions.