Opening the book…
Fractals are mathematical sets, usually obtained through recursion, that exhibit interesting dimensional properties.
- 15.1: Fractals
- Fractals are mathematical sets, usually obtained through recursion, that exhibit interesting dimensional properties. We’ll explore what that sentence means through the rest of the chapter. For now, we can begin with the idea of self-similarity, a characteristic of most fractals.
- 15.2: Iterated Fractals
- Fractal self-similar behavior can be replicated through recursion: repeating a process over and over.
- 15.3: Fractal Dimension
- In addition to visual self-similarity, fractals exhibit other interesting properties. For example, notice that each step of the Sierpinski gasket iteration removes one quarter of the remaining area. If this process is continued indefinitely, we would end up essentially removing all the area, meaning we started with a 2-dimensional area, and somehow end up with something less than that, but seemingly more than just a 1-dimensional line.
- 15.5: Complex Recursive Sequences
- We will now explore recursively defined sequences of complex numbers.
Thumbnail: Zoom in of the Mandelbrot set (Public Domain; Simpsons contributor via Wikipedia)
This page titled 15: Fractals was last modified on Sat, 02 Jan 2021 09:25:34 GMT and is shared under a CC BY-SA 3.0 license and was authored, remixed, and/or curated by David Lippman (The OpenTextBookStore) via source content that was edited to the style and standards of the LibreTexts platform.
The book could not be loaded just now.