Fractals and Fractal Geometry, Coastline Paradox, Spectral

Total Page:16

File Type:pdf, Size:1020Kb

Fractals and Fractal Geometry, Coastline Paradox, Spectral Lecture №14: Fractals and fractal geometry, coastline paradox, spectral characteristics of dynamical systems, 1-D complex valued maps, Mandelbrot set and nonlinear dynamical systems, introduction to applications of fractal geometry and chaos Dmitri Kartofelev, PhD Tallinn University of Technology, School of Science, Department of Cybernetics, Laboratory of Solid Mechanics D. Kartofelev YFX1520 1 / 41 Lecture outline Definition of fractal Spectral characteristics of periodic, quasi-periodic and chaotic systems Second look at 1-D and 2-D maps, complex valued maps Mandelbrot set and Julia sets, connection to nonlinear dynamical systems Generation of the Mandelbrot set and the corresponding Julia sets Buddhabrot Multibrot sets Examples of fractal geometry in nature and applications Introduction to applications of fractals and chaos Fractal similarity dimension and the coastline paradox Synchronisation D. Kartofelev YFX1520 2 / 41 Definition of fractal1 Fractal Endless and complex geometric shape with fine structure at arbitrarily small scales. In other words magnification of tiny features of a fractal are reminiscent of the whole. Similarity can be exact (invariant), more often it is approximate or statistical. Examples: Cantor set, von Kock curve, Hilbert curve, L-systems, etc. 1See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 3 / 41 Spectral characteristics of dynamical systems Power spectrum of x(t), periodic Power spectrum of sin(ω(t)), quasi-periodic 0 5 -5 0 -10 -5 -15 -10 -20 -15 Spectral Power Level Spectral Power Level -25 -20 -30 0 50 100 150 200 0 5 10 15 20 25 30 35 Frequency ω Frequency ω Power spectrum of x(t), chaotic 0 -5 -10 Spectral Power Level -15 0 10 20 30 40 Frequency ω Figure: (Top left) Sine wave shown with the red and a periodic solution of the Lorenz attractor shown with the blue. (Top right) Quasi-periodic solution. (Bottom) Chaotic solution. D. Kartofelev YFX1520 4 / 41 Dynamics analysis methods ( x0 = f (x0 ; y0 ) n+1 1 n n ) r = f (r ) (1) 0 0 0 n+1 3 n yn+1 = f2(xn; yn) ~ 0 0 0 0 0 T Construction of the Poincar´emap P (~x ) = (f1(x ; y ); f2(x ; y )) (1). Mapping of the Poincar´esection points where r is the radial distance from the origin (“flat” attractor). D. Kartofelev YFX1520 5 / 41 Dynamics analysis methods ) Orbit diagram { long-term discrete-time behaviour analysis. D. Kartofelev YFX1520 6 / 41 Mandelbrot set and dynamical systems The Mandelbrot set2 M is defined as follows 8 2 + >zn+1 = zn + c; fz; cg 2 C; n 2 Z <> z0 = 0 (2) > :>c 2 M () lim sup jzn+1j ≤ 2 n!1 1.0 0.5 ) c ( 0.0 Im -0.5 -1.0 -2.0-1.5-1.0-0.5 0.0 0.5 Re(c) 2See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 7 / 41 Mandelbrot set The complex square map given in the form 2 zn+1 = zn + c; (3) where z = x + iy, c = r + is, and z; c 2 C, can be represented as a 2-D real valued map. The component form of (3) is 2 xn+1 + iyn+1 = (xn + iyn) + r + is; (4) 2 2 xn+1 + iyn+1 = xn + 2ixnyn − yn + r + is; (5) 2 2 xn+1 + iyn+1 = xn − yn + r + i(2xnyn + s): (6) Separation of the real and imaginary parts, and elimination of the imaginary unit i yields ( ( x = x2 − y2 + r x = x2 − y2 + r; n+1 n n ) n+1 n n (7) ¡iyn+1 = ¡i(2xnyn + s) yn+1 = 2xnyn + s; where x, y, r, s 2 R. D. Kartofelev YFX1520 8 / 41 1-D complex maps, non-trivial dynamics Fixing the polynomial System dynamics D. Kartofelev YFX1520 9 / 41 Mandelbrot set, self-similar properties (video) No embedded video files in this pdf D. Kartofelev YFX1520 10 / 41 Julia sets and dynamical systems The Julia set3 J is defined as follows 8 2 + >zn+1 = zn + c; fz; cg 2 C; n 2 Z <> c = const. = jcj ≤ 2 (8) > :>z0 2 J () lim sup jzn+1j ≤ 2 n!1 0.5 ) z ( 0.0 Im -0.5 -1.5 -1.0 -0.5 0.0 0.5 1.0 1.5 Re(z) Figure: Filled Julia set where c = −1:1 − 0:1i. 3See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 11 / 41 Mandelbrot set and filled Julia sets D. Kartofelev YFX1520 12 / 41 Mandelbrot set and Julia sets D. Kartofelev YFX1520 13 / 41 Fractal dimension of the edge d = 2:0 Credit: CC BY-SA 3.0 Adam Majewski, Wolf Jung, J.C. Sprott D. Kartofelev YFX1520 14 / 41 Mandelbrot set and period-p orbits Credit: CC BY-SA 3.0 Hoehue commonswiki D. Kartofelev YFX1520 15 / 41 Cardioid Certain caustics can take the shape of cardioid. Figure: Caustic in a coffee cup. Credit: CC BY-SA 3.0 G´erard Janot D. Kartofelev YFX1520 16 / 41 Mandelbrot set, Buddhabrot The image is rotated in a clockwise direction by 90◦. Credit: CC BY-SA 3.0 Purpy Pupple, Evercat, Michael Pohoreski D. Kartofelev YFX1520 17 / 41 Generalised Mandelbrot set, Multibrot set4 p zn+1 = zn + c; z0 = 0 (9) -2 -1 0 1 2 -2 -1 0 1 2 -2 -1 0 1 2 2 2 2 2 2 2 1 1 1 1 1 1 ) ) ) c c c ( 0 0 ( 0 0 ( 0 0 Im Im Im -1 -1 -1 -1 -1 -1 -2 -2 -2 -2 -2 -2 -2 -1 0 1 2 -2 -1 0 1 2 -2 -1 0 1 2 Re(c) Re(c) Re(c) p = 3, p = 4 p = 5 main bulb is nephroid 4See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 18 / 41 Generalised Mandelbrot set, Multibrot set p zn+1 = zn + c; z0 = 0 -2 -1 0 1 2 -2 -1 0 1 2 -2 -1 0 1 2 2 2 2 2 2 2 1 1 1 1 1 1 ) ) ) c c c ( 0 0 ( 0 0 ( 0 0 Im Im Im -1 -1 -1 -1 -1 -1 -2 -2 -2 -2 -2 -2 -2 -1 0 1 2 -2 -1 0 1 2 -2 -1 0 1 2 Re(c) Re(c) Re(c) p = 5:5 p = 10 p = 45 D. Kartofelev YFX1520 19 / 41 Fractal geometry and nature D. Kartofelev YFX1520 20 / 41 Fractal geometry and nature Yarlung Tsangpo River, China. Credit: NASA/GSFC/LaRC/JPL, MISR Team. D. Kartofelev YFX1520 21 / 41 Fractal geometry and nature D. Kartofelev YFX1520 22 / 41 Fractal geometry and nature No embedded video files in this pdf D. Kartofelev YFX1520 23 / 41 Fractal geometry and nature D. Kartofelev YFX1520 24 / 41 Fractal geometry and nature (computer graphics) D. Kartofelev YFX1520 25 / 41 Fractal geometry and nature (computer graphics) Brownian noise with d = 2:0 ! topography. D. Kartofelev YFX1520 26 / 41 Fractal geometry and technology D. Kartofelev YFX1520 27 / 41 Coastline paradox The coastline paradox5 is the counterintuitive observation that the coastline of a landmass does not have a well-defined length. This results from the fractal-like properties of coastlines. The first recorded observation of this phenomenon was by Lewis Fry Richardson and it was expanded by Benoit Mandelbrot. Read: B. Mandelbrot, \How long is the coast of Britain? Statistical self-similarity and fractional dimension," Science, New Series, 156(3775), 1967, pp. 636{638. 5See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 28 / 41 Coastline paradox ∆x = b ∆x = a Slope of the resulting graph ln(L(∆x)) ln(L(∆x)) d = − = ; (10) ln(∆x) ln(1=∆x) where L is the resulting measurement and ∆x is the measurement resolution, i.e., length of the measuring stick. D. Kartofelev YFX1520 29 / 41 Coastline paradox D. Kartofelev YFX1520 30 / 41 Coastline paradox, Estonia6 Resulting length= 809 km 6See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 31 / 41 Coastline paradox, Estonia Resulting length= 1473 km D. Kartofelev YFX1520 32 / 41 Coastline paradox, von Kock snowflake7 Measured length 3.16879 Measured length 4.91986 7See Mathematica .nb file uploaded to course webpage. D. Kartofelev YFX1520 33 / 41 Coastline paradox Great Britain d = 1:25; Norway d = 1:52; Estonia∗ d = 1:2; South African coast d = 1:0 D. Kartofelev YFX1520 34 / 41 Synchronisation: metronomes No embedded video files in this pdf D. Kartofelev YFX1520 35 / 41 Synchronisation: fireflies No embedded video files in this pdf D. Kartofelev YFX1520 36 / 41 Synchronisation: Millennium bridge (2000) No embedded video files in this pdf D. Kartofelev YFX1520 37 / 41 Synchronisation Aperiodicity of chaos ! bifurcation/s ! periodic solution Conceptual model φ_ = µ − sin φ, (11) where µ ≥ 0 is the system parameter and φ is the phase difference/s. ϕ′ ϕ′ ϕ′ 2.0 2.0 2.0 1.5 1.5 1.5 1.0 1.0 1.0 0.5 0.5 0.5 ϕ ϕ ϕ -3 -2 -1 1 2 3 -3 -2 -1 1 2 3 -3 -2 -1 1 2 3 -0.5 -0.5 -0.5 -1.0 -1.0 -1.0 µ > 1 0 < µ < 1 µ = 0 D. Kartofelev YFX1520 38 / 41 Conclusions Definition of fractal Spectral characteristics of periodic, quasi-periodic and chaotic systems Second look at 1-D and 2-D maps, complex valued maps Mandelbrot set and Julia sets, connection to nonlinear dynamical systems Generation of the Mandelbrot set and the corresponding Julia sets Buddhabrot Multibrot sets Examples of fractal geometry in nature and applications Introduction to applications of fractals and chaos Fractal similarity dimension and the coastline paradox Synchronisation D. Kartofelev YFX1520 39 / 41 Revision questions Define fractal (technical definition).
Recommended publications
  • On the Mandelbrot Set for I2 = ±1 and Imaginary Higgs Fields
    Journal of Advances in Applied Mathematics, Vol. 6, No. 2, April 2021 https://dx.doi.org/10.22606/jaam.2021.62001 27 On the Mandelbrot Set for i2 = ±1 and Imaginary Higgs Fields Jonathan Blackledge Stokes Professor, Science Foundation Ireland. Distinguished Professor, Centre for Advanced Studies, Warsaw University of Technology, Poland. Visiting Professor, Faculty of Arts, Science and Technology, Wrexham Glyndwr University of Wales, UK. Professor Extraordinaire, Faculty of Natural Sciences, University of Western Cape, South Africa. Honorary Professor, School of Electrical and Electronic Engineering, Technological University Dublin, Ireland. Honorary Professor, School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, South Africa. Email: [email protected] Abstract We consider the consequence√ of breaking with a fundamental result in complex analysis by letting i2 = ±1 where i = −1 is the basic unit of all imaginary numbers. An analysis of the Mandelbrot set for this case shows that a demarcation between a Fractal and a Euclidean object is possible based on i2 = −1 and i2 = +1, respectively. Further, we consider the transient behaviour associated with the two cases to produce a range of non-standard sets in which a Fractal geometric structure is transformed into a Euclidean object. In the case of the Mandelbrot set, the Euclidean object is a square whose properties are investigate. Coupled with the associated Julia sets and other complex plane mappings, this approach provides the potential to generate a wide range of new semi-fractal structures which are visually interesting and may be of artistic merit. In this context, we present a mathematical paradox which explores the idea that i2 = ±1.
    [Show full text]
  • Fractal Growth on the Surface of a Planet and in Orbit Around It
    Wilfrid Laurier University Scholars Commons @ Laurier Physics and Computer Science Faculty Publications Physics and Computer Science 10-2014 Fractal Growth on the Surface of a Planet and in Orbit around It Ioannis Haranas Wilfrid Laurier University, [email protected] Ioannis Gkigkitzis East Carolina University, [email protected] Athanasios Alexiou Ionian University Follow this and additional works at: https://scholars.wlu.ca/phys_faculty Part of the Mathematics Commons, and the Physics Commons Recommended Citation Haranas, I., Gkigkitzis, I., Alexiou, A. Fractal Growth on the Surface of a Planet and in Orbit around it. Microgravity Sci. Technol. (2014) 26:313–325. DOI: 10.1007/s12217-014-9397-6 This Article is brought to you for free and open access by the Physics and Computer Science at Scholars Commons @ Laurier. It has been accepted for inclusion in Physics and Computer Science Faculty Publications by an authorized administrator of Scholars Commons @ Laurier. For more information, please contact [email protected]. 1 Fractal Growth on the Surface of a Planet and in Orbit around it 1Ioannis Haranas, 2Ioannis Gkigkitzis, 3Athanasios Alexiou 1Dept. of Physics and Astronomy, York University, 4700 Keele Street, Toronto, Ontario, M3J 1P3, Canada 2Departments of Mathematics and Biomedical Physics, East Carolina University, 124 Austin Building, East Fifth Street, Greenville, NC 27858-4353, USA 3Department of Informatics, Ionian University, Plateia Tsirigoti 7, Corfu, 49100, Greece Abstract: Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times.
    [Show full text]
  • Chapter 6: Ensemble Forecasting and Atmospheric Predictability
    Chapter 6: Ensemble Forecasting and Atmospheric Predictability Introduction Deterministic Chaos (what!?) In 1951 Charney indicated that forecast skill would break down, but he attributed it to model errors and errors in the initial conditions… In the 1960’s the forecasts were skillful for only one day or so. Statistical prediction was equal or better than dynamical predictions, Like it was until now for ENSO predictions! Lorenz wanted to show that statistical prediction could not match prediction with a nonlinear model for the Tokyo (1960) NWP conference So, he tried to find a model that was not periodic (otherwise stats would win!) He programmed in machine language on a 4K memory, 60 ops/sec Royal McBee computer He developed a low-order model (12 d.o.f) and changed the parameters and eventually found a nonperiodic solution Printed results with 3 significant digits (plenty!) Tried to reproduce results, went for a coffee and OOPS! Lorenz (1963) discovered that even with a perfect model and almost perfect initial conditions the forecast loses all skill in a finite time interval: “A butterfly in Brazil can change the forecast in Texas after one or two weeks”. In the 1960’s this was only of academic interest: forecasts were useless in two days Now, we are getting closer to the 2 week limit of predictability, and we have to extract the maximum information Central theorem of chaos (Lorenz, 1960s): a) Unstable systems have finite predictability (chaos) b) Stable systems are infinitely predictable a) Unstable dynamical system b) Stable dynamical
    [Show full text]
  • Using Fractal Dimension for Target Detection in Clutter
    KIM T. CONSTANTIKES USING FRACTAL DIMENSION FOR TARGET DETECTION IN CLUTTER The detection of targets in natural backgrounds requires that we be able to compute some characteristic of target that is distinct from background clutter. We assume that natural objects are fractals and that the irregularity or roughness of the natural objects can be characterized with fractal dimension estimates. Since man-made objects such as aircraft or ships are comparatively regular and smooth in shape, fractal dimension estimates may be used to distinguish natural from man-made objects. INTRODUCTION Image processing associated with weapons systems is fractal. Falconer1 defines fractals as objects with some or often concerned with methods to distinguish natural ob­ all of the following properties: fine structure (i.e., detail jects from man-made objects. Infrared seekers in clut­ on arbitrarily small scales) too irregular to be described tered environments need to distinguish the clutter of with Euclidean geometry; self-similar structure, with clouds or solar sea glint from the signature of the intend­ fractal dimension greater than its topological dimension; ed target of the weapon. The discrimination of target and recursively defined. This definition extends fractal from clutter falls into a category of methods generally into a more physical and intuitive domain than the orig­ called segmentation, which derives localized parameters inal Mandelbrot definition whereby a fractal was a set (e.g.,texture) from the observed image intensity in order whose "Hausdorff-Besicovitch dimension strictly exceeds to discriminate objects from background. Essentially, one its topological dimension.,,2 The fine, irregular, and self­ wants these parameters to be insensitive, or invariant, to similar structure of fractals can be experienced firsthand the kinds of variation that the objects and background by looking at the Mandelbrot set at several locations and might naturally undergo because of changes in how they magnifications.
    [Show full text]
  • Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity
    Journal of Computer Science 4 (5): 408-414, 2008 ISSN 1549-3636 © 2008 Science Publications Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity Mohammad Ahmad Alia and Azman Bin Samsudin School of Computer Sciences, University Sains Malaysia, 11800 Penang, Malaysia Abstract: We proposed a new zero-knowledge proof of identity protocol based on Mandelbrot and Julia Fractal sets. The Fractal based zero-knowledge protocol was possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, the private key was used as an input parameter for Mandelbrot Fractal function to generate the corresponding public key. Julia Fractal function was then used to calculate the verified value based on the existing private key and the received public key. The proposed protocol was designed to be resistant against attacks. Fractal based zero-knowledge protocol was an attractive alternative to the traditional number theory zero-knowledge protocol. Key words: Zero-knowledge, cryptography, fractal, mandelbrot fractal set and julia fractal set INTRODUCTION Zero-knowledge proof of identity system is a cryptographic protocol between two parties. Whereby, the first party wants to prove that he/she has the identity (secret word) to the second party, without revealing anything about his/her secret to the second party. Following are the three main properties of zero- knowledge proof of identity[1]: Completeness: The honest prover convinces the honest verifier that the secret statement is true. Soundness: Cheating prover can’t convince the honest verifier that a statement is true (if the statement is really false). Fig. 1: Zero-knowledge cave Zero-knowledge: Cheating verifier can’t get anything Zero-knowledge cave: Zero-Knowledge Cave is a other than prover’s public data sent from the honest well-known scenario used to describe the idea of zero- prover.
    [Show full text]
  • A Gentle Introduction to Dynamical Systems Theory for Researchers in Speech, Language, and Music
    A Gentle Introduction to Dynamical Systems Theory for Researchers in Speech, Language, and Music. Talk given at PoRT workshop, Glasgow, July 2012 Fred Cummins, University College Dublin [1] Dynamical Systems Theory (DST) is the lingua franca of Physics (both Newtonian and modern), Biology, Chemistry, and many other sciences and non-sciences, such as Economics. To employ the tools of DST is to take an explanatory stance with respect to observed phenomena. DST is thus not just another tool in the box. Its use is a different way of doing science. DST is increasingly used in non-computational, non-representational, non-cognitivist approaches to understanding behavior (and perhaps brains). (Embodied, embedded, ecological, enactive theories within cognitive science.) [2] DST originates in the science of mechanics, developed by the (co-)inventor of the calculus: Isaac Newton. This revolutionary science gave us the seductive concept of the mechanism. Mechanics seeks to provide a deterministic account of the relation between the motions of massive bodies and the forces that act upon them. A dynamical system comprises • A state description that indexes the components at time t, and • A dynamic, which is a rule governing state change over time The choice of variables defines the state space. The dynamic associates an instantaneous rate of change with each point in the state space. Any specific instance of a dynamical system will trace out a single trajectory in state space. (This is often, misleadingly, called a solution to the underlying equations.) Description of a specific system therefore also requires specification of the initial conditions. In the domain of mechanics, where we seek to account for the motion of massive bodies, we know which variables to choose (position and velocity).
    [Show full text]
  • An Image Cryptography Using Henon Map and Arnold Cat Map
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 05 Issue: 04 | Apr-2018 www.irjet.net p-ISSN: 2395-0072 An Image Cryptography using Henon Map and Arnold Cat Map. Pranjali Sankhe1, Shruti Pimple2, Surabhi Singh3, Anita Lahane4 1,2,3 UG Student VIII SEM, B.E., Computer Engg., RGIT, Mumbai, India 4Assistant Professor, Department of Computer Engg., RGIT, Mumbai, India ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - In this digital world i.e. the transmission of non- 2. METHODOLOGY physical data that has been encoded digitally for the purpose of storage Security is a continuous process via which data can 2.1 HENON MAP be secured from several active and passive attacks. Encryption technique protects the confidentiality of a message or 1. The Henon map is a discrete time dynamic system information which is in the form of multimedia (text, image, introduces by michel henon. and video).In this paper, a new symmetric image encryption 2. The map depends on two parameters, a and b, which algorithm is proposed based on Henon’s chaotic system with for the classical Henon map have values of a = 1.4 and byte sequences applied with a novel approach of pixel shuffling b = 0.3. For the classical values the Henon map is of an image which results in an effective and efficient chaotic. For other values of a and b the map may be encryption of images. The Arnold Cat Map is a discrete system chaotic, intermittent, or converge to a periodic orbit. that stretches and folds its trajectories in phase space. Cryptography is the process of encryption and decryption of 3.
    [Show full text]
  • Rendering Hypercomplex Fractals Anthony Atella [email protected]
    Rhode Island College Digital Commons @ RIC Honors Projects Overview Honors Projects 2018 Rendering Hypercomplex Fractals Anthony Atella [email protected] Follow this and additional works at: https://digitalcommons.ric.edu/honors_projects Part of the Computer Sciences Commons, and the Other Mathematics Commons Recommended Citation Atella, Anthony, "Rendering Hypercomplex Fractals" (2018). Honors Projects Overview. 136. https://digitalcommons.ric.edu/honors_projects/136 This Honors is brought to you for free and open access by the Honors Projects at Digital Commons @ RIC. It has been accepted for inclusion in Honors Projects Overview by an authorized administrator of Digital Commons @ RIC. For more information, please contact [email protected]. Rendering Hypercomplex Fractals by Anthony Atella An Honors Project Submitted in Partial Fulfillment of the Requirements for Honors in The Department of Mathematics and Computer Science The School of Arts and Sciences Rhode Island College 2018 Abstract Fractal mathematics and geometry are useful for applications in science, engineering, and art, but acquiring the tools to explore and graph fractals can be frustrating. Tools available online have limited fractals, rendering methods, and shaders. They often fail to abstract these concepts in a reusable way. This means that multiple programs and interfaces must be learned and used to fully explore the topic. Chaos is an abstract fractal geometry rendering program created to solve this problem. This application builds off previous work done by myself and others [1] to create an extensible, abstract solution to rendering fractals. This paper covers what fractals are, how they are rendered and colored, implementation, issues that were encountered, and finally planned future improvements.
    [Show full text]
  • The Age of Addiction David T. Courtwright Belknap (2019) Opioids
    The Age of Addiction David T. Courtwright Belknap (2019) Opioids, processed foods, social-media apps: we navigate an addictive environment rife with products that target neural pathways involved in emotion and appetite. In this incisive medical history, David Courtwright traces the evolution of “limbic capitalism” from prehistory. Meshing psychology, culture, socio-economics and urbanization, it’s a story deeply entangled in slavery, corruption and profiteering. Although reform has proved complex, Courtwright posits a solution: an alliance of progressives and traditionalists aimed at combating excess through policy, taxation and public education. Cosmological Koans Anthony Aguirre W. W. Norton (2019) Cosmologist Anthony Aguirre explores the nature of the physical Universe through an intriguing medium — the koan, that paradoxical riddle of Zen Buddhist teaching. Aguirre uses the approach playfully, to explore the “strange hinterland” between the realities of cosmic structure and our individual perception of them. But whereas his discussions of time, space, motion, forces and the quantum are eloquent, the addition of a second framing device — a fictional journey from Enlightenment Italy to China — often obscures rather than clarifies these chewy cosmological concepts and theories. Vanishing Fish Daniel Pauly Greystone (2019) In 1995, marine biologist Daniel Pauly coined the term ‘shifting baselines’ to describe perceptions of environmental degradation: what is viewed as pristine today would strike our ancestors as damaged. In these trenchant essays, Pauly trains that lens on fisheries, revealing a global ‘aquacalypse’. A “toxic triad” of under-reported catches, overfishing and deflected blame drives the crisis, he argues, complicated by issues such as the fishmeal industry, which absorbs a quarter of the global catch.
    [Show full text]
  • Learning from Benoit Mandelbrot
    2/28/18, 7(59 AM Page 1 of 1 February 27, 2018 Learning from Benoit Mandelbrot If you've been reading some of my recent posts, you will have noted my, and the Investment Masters belief, that many of the investment theories taught in most business schools are flawed. And they can be dangerous too, the recent Financial Crisis is evidence of as much. One man who, prior to the Financial Crisis, issued a challenge to regulators including the Federal Reserve Chairman Alan Greenspan, to recognise these flaws and develop more realistic risk models was Benoit Mandelbrot. Over the years I've read a lot of investment books, and the name Benoit Mandelbrot comes up from time to time. I recently finished his book 'The (Mis)Behaviour of Markets - A Fractal View of Risk, Ruin and Reward'. So who was Benoit Mandelbrot, why is he famous, and what can we learn from him? Benoit Mandelbrot was a Polish-born mathematician and polymath, a Sterling Professor of Mathematical Sciences at Yale University and IBM Fellow Emeritus (Physics) who developed a new branch of mathematics known as 'Fractal' geometry. This geometry recognises the hidden order in the seemingly disordered, the plan in the unplanned, the regular pattern in the irregularity and roughness of nature. It has been successfully applied to the natural sciences helping model weather, study river flows, analyse brainwaves and seismic tremors. A 'fractal' is defined as a rough or fragmented shape that can be split into parts, each of which is at least a close approximation of its original-self.
    [Show full text]
  • Generating Fractals Using Complex Functions
    Generating Fractals Using Complex Functions Avery Wengler and Eric Wasser What is a Fractal? ● Fractals are infinitely complex patterns that are self-similar across different scales. ● Created by repeating simple processes over and over in a feedback loop. ● Often represented on the complex plane as 2-dimensional images Where do we find fractals? Fractals in Nature Lungs Neurons from the Oak Tree human cortex Regardless of scale, these patterns are all formed by repeating a simple branching process. Geometric Fractals “A rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole.” Mandelbrot (1983) The Sierpinski Triangle Algebraic Fractals ● Fractals created by repeatedly calculating a simple equation over and over. ● Were discovered later because computers were needed to explore them ● Examples: ○ Mandelbrot Set ○ Julia Set ○ Burning Ship Fractal Mandelbrot Set ● Benoit Mandelbrot discovered this set in 1980, shortly after the invention of the personal computer 2 ● zn+1=zn + c ● That is, a complex number c is part of the Mandelbrot set if, when starting with z0 = 0 and applying the iteration repeatedly, the absolute value of zn remains bounded however large n gets. Animation based on a static number of iterations per pixel. The Mandelbrot set is the complex numbers c for which the sequence ( c, c² + c, (c²+c)² + c, ((c²+c)²+c)² + c, (((c²+c)²+c)²+c)² + c, ...) does not approach infinity. Julia Set ● Closely related to the Mandelbrot fractal ● Complementary to the Fatou Set Featherino Fractal Newton’s method for the roots of a real valued function Burning Ship Fractal z2 Mandelbrot Render Generic Mandelbrot set.
    [Show full text]
  • Joint Session: Measuring Fractals Diversity in Mathematics, 2019
    Joint Session: Measuring Fractals Diversity in Mathematics, 2019 Tongou Yang The University of British Columbia, Vancouver [email protected] July 2019 Tongou Yang (UBC) Fractal Lectures July 2019 1 / 12 Let's Talk Geography Which country has the longest coastline? What is the longest river on earth? Tongou Yang (UBC) Fractal Lectures July 2019 2 / 12 (a) Map of Canada (b) Map of Nunavut Which country has the longest coastline? List of countries by length of coastline Tongou Yang (UBC) Fractal Lectures July 2019 3 / 12 (b) Map of Nunavut Which country has the longest coastline? List of countries by length of coastline (a) Map of Canada Tongou Yang (UBC) Fractal Lectures July 2019 3 / 12 Which country has the longest coastline? List of countries by length of coastline (a) Map of Canada (b) Map of Nunavut Tongou Yang (UBC) Fractal Lectures July 2019 3 / 12 What's the Longest River on Earth? A Youtube Video Tongou Yang (UBC) Fractal Lectures July 2019 4 / 12 Measuring a Smooth Curve Example: use a rope Figure: Boundary between CA and US on the Great Lakes Tongou Yang (UBC) Fractal Lectures July 2019 5 / 12 Measuring a Rugged Coastline Figure: Coast of Nova Scotia Tongou Yang (UBC) Fractal Lectures July 2019 6 / 12 Covering by Grids 4 3 2 1 0 0 1 2 3 4 Tongou Yang (UBC) Fractal Lectures July 2019 7 / 12 Counting Grids Number of Grids=15 Side Length ≈ 125km Coastline ≈ 15 × 125 = 1845km. Tongou Yang (UBC) Fractal Lectures July 2019 8 / 12 Covering by Finer Grids 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9 Tongou Yang (UBC) Fractal Lectures July 2019 9 / 12 Counting Grids Number of Grids=34 Side Length ≈ 62km Coastline ≈ 34 × 62 = 2108km.
    [Show full text]