Functional iteration, the process of forming a sequence x0, x1 = f(x0), x2 = f(x1) = f(f(x0)) = f2(x0), . . ., by repeated application of a function f, is fundamental to the approximation of solutions to nonlinear equations and plays an important role in the study of nonlinear dynamics. In this note we examine another aspect of functional iteration: the global behavior of the sequence f, f2, f3, . . ., fn, . . . of composite functions as n → ∞. This topic can be presented to students at many levels using computer graphics to stimulate conjectures that can then be investigated theoretically.
You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither BioOne nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the BioOne website.