A function consists of a set of instructions that convert given input values to output values. Now if the output itself is part of the domain of the function considered, it can become an input in turn, and the function returns new output values. This process can then be repeated indefinitely. While there are often no analytic methods to calculate the structural properties of such iterations of the form x t +1 = f(x t ), they are easily generated on the computer. Obviously, one just has to apply the same function f(x) to the result repeatedly. We want to demonstrate this with a few examples.
Unable to display preview. Download preview PDF.
- Crandall R.E. (1991) Mathematica for the Sciences. Addison-Wesley, Redwood City, CAGoogle Scholar
- Jodl H.-J., Korsch H.J. (1994) Chaos: A Program Collection for the PC. Springer, Berlin, Heidelberg, New YorkGoogle Scholar
- Ott E. (1993) Chaos in Dynamical Systems. Cambridge University Press, Cambridge, New YorkGoogle Scholar
- Peitgen H. O., Saupe D. (1988) The Science of Fractal Images. Springer, Berlin, Heidelberg, New YorkGoogle Scholar
- Schroeder M. (1991) Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W. H. Freeman, New YorkGoogle Scholar
- Griffiths R.B. (1990) Frenkel-Kontorova Models of Commensurate-Incommensurate Phase Transitions. In: van Beijeren H. (Ed.) Fundamental Problems in Statistical Mechanics VII. Elsevier, Amsterdam, New York, 69–110Google Scholar
- Hertz J., Krogh A., Palmer R.G. (1991) Introduction to the Theory of Neural Computation. Addison-Wesley, Reading, MAGoogle Scholar