Abstract
In this work we present various tools for studying dynamical systems implemented in interval arithmetic. The methods include an algorithm for finding all low-period cycles enclosed in a specified region, finding an upper bound of the invariant and nonwandering part of a given set, finding a lower bound of the basin of attraction of a stable periodic orbit, and proving the existence of symbolic dynamics of a given type embedded in the map. Using these techniques a detailed study of the behaviour of the Ikeda map for different parameter values is performed.

This publication has 12 references indexed in Scilit: