DOCSLIB.ORG

Simulation of Sierpinski-Type Fractals and Their Geometric Constructions in Matlab Environment

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Simulation of Sierpinski-Type Fractals and Their Geometric Constructions in Matlab Environment WSEAS TRANSACTIONS on MATHEMATICS Zhiyong Zhu, Enemi Dong Simulation of Sierpinski-type fractals and their geometric constructions in Matlab environment Zhiyong Zhu* Enemi Dong Northwest A&F University Northwest A&F University College of Science College of Science Taicheng Road 3, 712100 Yangling Taicheng Road 3, 712100 Yangling China China [email protected] [email protected] Abstract: Study on properties of Sierpinski-type fractals, including dimension, measure, connectedness, Lipschitz equivalence, etc are very interesting. Although there have been some very nice results were obtained, there is still a long way to go to solve all the problems. In order to facilitate understanding of these results and further study, in this paper, we simulate this kind of fractals and their geometric constructions in Matlab environment that is more easily understood and mastered for researcher base on the recursive and iterative algorithms that are used to simulate fractals. Furthermore, our results are also interesting results to enrich the theoretical and applied research of fractal simulation. Key–Words: Sierpinski gasket-type fractal, Sierpinski carpet-type fractal, Fractal simulation, Recursive algorithm, Iterative algorithm, Matlab 1 Introduction have aroused wide concern ([2,4,7-10,13-16,18-21]). ≥ D ⊂ f − g2 Although there have been some very nice results were For an given integer n 2, let 0; : : : ; n 1 . obtained, there is still a long way to go to solve all We shall call the unique non-empty compact subset ⊂ R2 the problems. It is well know that the in-depth analy- ED satisfying the following set equation sis and understanding of topological structure of frac- tals are very important to study properties of fractals. ED = (ED + D)=n In this process, simulate the fractal and its geometric a Sierpinski carpet-type fractal throughout this construction by computer, will provide us the most in- paper. If the above set f0; : : : ; n − 1g2 is re- tuitive discussion and explanation. The computer sim- placed by ∆ = fk α + k β : k + k ≤ ulation of fractal patterns is based on the basic theory 1 2 1 2 of fractal, is one of the most popular area of study in n − 1 and k1; kp2 2 N [ f0gg;where α = (1; 0) computer graphics at present. Study the algorithms and β = (1=2; 3=2), then we call ED a Sierpinski and programs of drawing fractal not only can offer gasket-type fractal. In particular, for n = 3, D = technical support for the study of fractal theory, but f(0; 0); (1; 0); (2; 0); (0; 1); (2; 1); (0; 2); (1; 2); (2; 2)g 2 also can stimulate creative inspiration, to further en- ⊂ f0; 1; : : : ; n − 1g , ED is well-known rich the content of computer graphics, and also can Sierpinski carpet,p and for n = 2, D = drive a lot of old discipline in newborn. For exam- f(0; 0); (1; 0); (1=2; 3=2)g ⊂ ∆, ED is well- ple, the complex analysis don’t obtain further devel- known Sierpinski gasket. Let I = [0; 1]2 or be the opment for many years, until the computer graphics following set display completely the complex structures of Julia set, the mathematical theory of this discipline was once fc1α + c2β : c1 + c2 ≤ 1 and 0 ≤ c1; c2 ≤ 1g: again leap development. At present, although many 1 k+1 works(computer programming) have been devoted to We define ED = (I + D)=n, and recurrently, ED = k k the study of the computer simulation of Sierpinski- (ED + D)=n for k ≥ 1. Then ED is a union of k type fractals, especially the classic Sierpinski carpet squares(equilateral triangles) of side 1=n . Clearly, and Sierpinski gasket [1, 5, 11, 17], these source codes k+1 ⊂ k \1 k ED ED and ED = k=1ED. of computer programs that we saw in these works are In recent years, study on properties of Sierpinski- mostly written by the programming language: Java, type fractals described as above, including dimension, C++, Delphi, Java, etc. Thus these works are usually measure, connectedness, Lipschitz equivalence, etc E-ISSN: 2224-2880 992 Issue 10, Volume 12, October 2013 WSEAS TRANSACTIONS on MATHEMATICS Zhiyong Zhu, Enemi Dong not easy to be understood and applied for researchers 2 Some basic facts and concepts to engage in mathematics study, unless have the cor- responding knowledge of programming language. In 2.1 Function M-files addition, since the majority of these works came from For simple problems, entering your requests at the the researchers and engineering and technical person- Matlab command window prompt is fast and efficient. nel that engage in the fields of computer graphics and However, as the number of commands increases or digital image processing etc, thus these works usually trial and error is done by changing certain variables tend to ignore mathematical problems in study, and or values, typing the commands over and over at the focus on the design and the realization of computer Matlab command window prompt becomes tedious. algorithms of drawing fractal. So the different fine k k+1 To get around this, we enter the commands into a text structures of ED and ED mentioned as above can’t file (called M-files or Script M-files [12]), and exe- well described by these works on one hand, but on the cute them by simply typing filename at the Matlab other hand we also can’t easy to obtain any Sierpinski- command window prompt. All function M-file names type fractal pattern is what we need in the study only must end with the extension ‘.m’ (e.g. test.m). Func- by modifying a few parameters. But these contents tion M-files are like Script M-files but can pass param- just are the most important for researchers of studying eters and isolate variables. The structure of a typical the properties of such fractals. How to use a popular function M-file, say my fun.m, is as follows: and easy-to-understand way as much as possible, in function[output arguments]=my fun(input argu- a real-time information exchange interface, such that ments) the researchers can well-obtain any pattern is what they need in the study of a class of fractal patterns code by modifying a few parameters, without need to know ...... much about the knowledge of complex programming code language, at the same time complete some relative ...... functions such as color adjustment, graphical compar- Note that the word function appears at the start of the ison and storage etc, and generate fractal patterns with file. In addition, the output arguments and input argu- certain theoretical research value, has turned into one ments and name of the function are listed. If a func- of the hot problems concerned by many researchers. tion only has a single output argument, then the square For this motive and note that the powerful advan- brackets are not required. If a function does not have tages of Matlab in numerical calculation and graphic any output arguments, then neither the square brackets visual ability and its programming language is more nor the equals sign that follows are used. easily understood and mastered by mathematical re- searchers. In this paper, we study the simulation of the above-mentioned Sierpinski-type fractals and their 2.2 Recursion Theory geometric constructions in Matlab environment base Recursion is the process of repeating items in a self- on the recursive theory and iterative theory that are similar way [5]. In computer programming, recursion used to simulate fractals. Our results not only can k is a function that can directly or indirectly call itself. well-describe the different fine structures of ED and k+1 A general syntax of recursion in Matlab looks like ED in the process of constructing Siepinski-type this: fractal ED, but also can well present different patterns function Recur(n) are what we need in study only by modifying a few parameters. ...... Recur(m) ...... The rest of this paper is organized as follows. Recursion is a method of solving problems based on In section 2, some basic facts and known concepts the divide and conquer mentality. The basic idea needed in our discussion are described, for details, see is that you take the original problem and divide it [4, 7, 12, 17]. An algorithm and a computer program into smaller (more easily solved) instances of itself, of simulating the Sierpinski gasket-type fractals and solve those smaller instances (usually by using the their geometric constructions are given base on itera- same algorithm again) and then reassemble them into tive and recursive theory in section 3. In section 4, be- the final solution. In this paper, the recursive al- sides an program similar to section 3 is given, we will gorithm will be used in two places, one is to di- k 2 give the other algorithm and program of simulating vide each squares(triangles) in ED into n equal-sized the Sierpinski carpet-type fractals and their geometric squares(triangles) for any k, the other is to fill the constructions only by recursive theory. squares are removed after each division with white. E-ISSN: 2224-2880 993 Issue 10, Volume 12, October 2013 WSEAS TRANSACTIONS on MATHEMATICS Zhiyong Zhu, Enemi Dong 2.3 Theory of Iterated Function System(IFS) by certain transformation equations. For example, we may compute the lower-left coordinates of triangles in We call the finite set ffi : i = 1; 2;:::;Ng is an E1 by (2). iterated function system if each fi is a contraction D mapping on a complete metric space. Hutchinson [7] ®Assign the above calculated values to the vari- showed that, for the metric space Rd, such a system of able of lower-left coordinate of initial equilateral tri- functions has a unique nonempty compact set(closed angle respectively and ready to participate in the cal- and bounded) E such that culation.
Load more

Recommended publications
  • Review On: Fractal Antenna Design Geometries and Its Applications
    www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume - 3 Issue -9 September, 2014 Page No. 8270-8275 Review On: Fractal Antenna Design Geometries and Its Applications Ankita Tiwari1, Dr. Munish Rattan2, Isha Gupta3 1GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] 2GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] 3GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] Abstract: In this review paper, we provide a comprehensive review of developments in the field of fractal antenna engineering. First we give brief introduction about fractal antennas and then proceed with its design geometries along with its applications in different fields. It will be shown how to quantify the space filling abilities of fractal geometries, and how this correlates with miniaturization of fractal antennas. Keywords – Fractals, self -similar, space filling, multiband 1. Introduction Modern telecommunication systems require antennas with irrespective of various extremely irregular curves or shapes wider bandwidths and smaller dimensions as compared to the that repeat themselves at any scale on which they are conventional antennas. This was beginning of antenna research examined. in various directions; use of fractal shaped antenna elements was one of them. Some of these geometries have been The term “Fractal” means linguistically “broken” or particularly useful in reducing the size of the antenna, while “fractured” from the Latin “fractus.” The term was coined by others exhibit multi-band characteristics. Several antenna Benoit Mandelbrot, a French mathematician about 20 years configurations based on fractal geometries have been reported ago in his book “The fractal geometry of Nature” [5].
    [Show full text]
  • Spatial Accessibility to Amenities in Fractal and Non Fractal Urban Patterns Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser
    Spatial accessibility to amenities in fractal and non fractal urban patterns Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser To cite this version: Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser. Spatial accessibility to amenities in fractal and non fractal urban patterns. Environment and Planning B: Planning and Design, SAGE Publications, 2012, 39 (5), pp.801-819. 10.1068/b37132. hal-00804263 HAL Id: hal-00804263 https://hal.archives-ouvertes.fr/hal-00804263 Submitted on 14 Jun 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. TANNIER C., VUIDEL G., HOUOT H., FRANKHAUSER P. (2012), Spatial accessibility to amenities in fractal and non fractal urban patterns, Environment and Planning B: Planning and Design, vol. 39, n°5, pp. 801-819. EPB 137-132: Spatial accessibility to amenities in fractal and non fractal urban patterns Cécile TANNIER* ([email protected]) - corresponding author Gilles VUIDEL* ([email protected]) Hélène HOUOT* ([email protected]) Pierre FRANKHAUSER* ([email protected]) * ThéMA, CNRS - University of Franche-Comté 32 rue Mégevand F-25 030 Besançon Cedex, France Tel: +33 381 66 54 81 Fax: +33 381 66 53 55 1 Spatial accessibility to amenities in fractal and non fractal urban patterns Abstract One of the challenges of urban planning and design is to come up with an optimal urban form that meets all of the environmental, social and economic expectations of sustainable urban development.
    [Show full text]
  • Bachelorarbeit Im Studiengang Audiovisuelle Medien Die
    Bachelorarbeit im Studiengang Audiovisuelle Medien Die Nutzbarkeit von Fraktalen in VFX Produktionen vorgelegt von Denise Hauck an der Hochschule der Medien Stuttgart am 29.03.2019 zur Erlangung des akademischen Grades eines Bachelor of Engineering Erst-Prüferin: Prof. Katja Schmid Zweit-Prüfer: Prof. Jan Adamczyk Eidesstattliche Erklärung Name: Vorname: Hauck Denise Matrikel-Nr.: 30394 Studiengang: Audiovisuelle Medien Hiermit versichere ich, Denise Hauck, ehrenwörtlich, dass ich die vorliegende Bachelorarbeit mit dem Titel: „Die Nutzbarkeit von Fraktalen in VFX Produktionen“ selbstständig und ohne fremde Hilfe verfasst und keine anderen als die angegebenen Hilfsmittel benutzt habe. Die Stellen der Arbeit, die dem Wortlaut oder dem Sinn nach anderen Werken entnommen wurden, sind in jedem Fall unter Angabe der Quelle kenntlich gemacht. Die Arbeit ist noch nicht veröffentlicht oder in anderer Form als Prüfungsleistung vorgelegt worden. Ich habe die Bedeutung der ehrenwörtlichen Versicherung und die prüfungsrechtlichen Folgen (§26 Abs. 2 Bachelor-SPO (6 Semester), § 24 Abs. 2 Bachelor-SPO (7 Semester), § 23 Abs. 2 Master-SPO (3 Semester) bzw. § 19 Abs. 2 Master-SPO (4 Semester und berufsbegleitend) der HdM) einer unrichtigen oder unvollständigen ehrenwörtlichen Versicherung zur Kenntnis genommen. Stuttgart, den 29.03.2019 2 Kurzfassung Das Ziel dieser Bachelorarbeit ist es, ein Verständnis für die Generierung und Verwendung von Fraktalen in VFX Produktionen, zu vermitteln. Dabei bildet der Einblick in die Arten und Entstehung der Fraktale
    [Show full text]
  • Fractals a Fractal Is a Shape That Seem to Have the Same Structure No Matter How Far You Zoom In, Like the figure Below
    Fractals A fractal is a shape that seem to have the same structure no matter how far you zoom in, like the figure below. Sometimes it's only part of the shape that repeats. In the figure below, called an Apollonian Gasket, no part looks like the whole shape, but the parts near the edges still repeat when you zoom in. Today you'll learn how to construct a few fractals: • The Snowflake • The Sierpinski Carpet • The Sierpinski Triangle • The Pythagoras Tree • The Dragon Curve After you make a few of those, try constructing some fractals of your own design! There's more on the back. ! Challenge Problems In order to solve some of the more difficult problems today, you'll need to know about the geometric series. In a geometric series, we add up a sequence of terms, 1 each of which is a fixed multiple of the previous one. For example, if the ratio is 2 , then a geometric series looks like 1 1 1 1 1 1 1 + + · + · · + ::: 2 2 2 2 2 2 1 12 13 = 1 + + + + ::: 2 2 2 The geometric series has the incredibly useful property that we have a good way of 1 figuring out what the sum equals. Let's let r equal the common ratio (like 2 above) and n be the number of terms we're adding up. Our series looks like 1 + r + r2 + ::: + rn−2 + rn−1 If we multiply this by 1 − r we get something rather simple. (1 − r)(1 + r + r2 + ::: + rn−2 + rn−1) = 1 + r + r2 + ::: + rn−2 + rn−1 − ( r + r2 + ::: + rn−2 + rn−1 + rn ) = 1 − rn Thus 1 − rn 1 + r + r2 + ::: + rn−2 + rn−1 = : 1 − r If we're clever, we can use this formula to compute the areas and perimeters of some of the shapes we create.
    [Show full text]
  • Design and Development of Sierpinski Carpet Microstrip Fractal Antenna for Multiband Applications
    ISSN (Online) 2278-1021 ISSN (Print) 2319-5940 IJARCCE International Journal of Advanced Research in Computer and Communication Engineering NCRICT-2017 Ahalia School of Engineering and Technology Vol. 6, Special Issue 4, March 2017 Design and Development of Sierpinski Carpet Microstrip Fractal Antenna for Multiband Applications Suvarna Sivadas1, Saneesh V S2 PG Scholar, Department of ECE, Jawaharlal College of Engineering & Technology, Palakkad, India1 Assistant Professor, Department of ECE, Jawaharlal College of Engineering & Technology, Palakkad, India2 Abstract: The rapid growth of wireless technologies has drawn new demands for integrated components including antennas. Antenna miniaturization is necessary for achieving optimal design of modern handheld wireless communication devices. Numerous techniques have been proposed for the miniaturization of microstrip fractal antennas having multiband characteristics. A sierpinski carpet microstrip fractal antennas is designed in a centre frequency of 2.4 GHz which is been simulated. This is to understand the concept of antenna. Perform numerical solutions using HFSS software and to study the antenna properties by comparison of measurements and simulation results. Keywords: fractal; sierpinski carpet; multiband. I. INTRODUCTION In modern wireless communication systems wider Multiband frequency response that derives from bandwidth, multiband and low profile antennas are in great the inherent properties of the fractal geometry of the demand for various communication applications. This has antenna.
    [Show full text]
  • Paul S. Addison
    Page 1 Chapter 1— Introduction 1.1— Introduction The twin subjects of fractal geometry and chaotic dynamics have been behind an enormous change in the way scientists and engineers perceive, and subsequently model, the world in which we live. Chemists, biologists, physicists, physiologists, geologists, economists, and engineers (mechanical, electrical, chemical, civil, aeronautical etc) have all used methods developed in both fractal geometry and chaotic dynamics to explain a multitude of diverse physical phenomena: from trees to turbulence, cities to cracks, music to moon craters, measles epidemics, and much more. Many of the ideas within fractal geometry and chaotic dynamics have been in existence for a long time, however, it took the arrival of the computer, with its capacity to accurately and quickly carry out large repetitive calculations, to provide the tool necessary for the in-depth exploration of these subject areas. In recent years, the explosion of interest in fractals and chaos has essentially ridden on the back of advances in computer development. The objective of this book is to provide an elementary introduction to both fractal geometry and chaotic dynamics. The book is split into approximately two halves: the first—chapters 2–4—deals with fractal geometry and its applications, while the second—chapters 5–7—deals with chaotic dynamics. Many of the methods developed in the first half of the book, where we cover fractal geometry, will be used in the characterization (and comprehension) of the chaotic dynamical systems encountered in the second half of the book. In the rest of this chapter brief introductions to fractal geometry and chaotic dynamics are given, providing an insight to the topics covered in subsequent chapters of the book.
    [Show full text]
  • Fractals Dalton Allan and Brian Dalke College of Science, Engineering & Technology Nominated by Amy Hlavacek, Associate Professor of Mathematics
    Fractals Dalton Allan and Brian Dalke College of Science, Engineering & Technology Nominated by Amy Hlavacek, Associate Professor of Mathematics Dalton is a dual-enrolled student at Saginaw Arts and Sciences Academy and Saginaw Valley State University. He has taken mathematics classes at SVSU for the past four years and physics classes for the past year. Dalton has also worked in the Math and Physics Resource Center since September 2010. Dalton plans to continue his study of mathematics at the Massachusetts Institute of Technology. Brian is a part-time mathematics and English student. He has a B.S. degree with majors in physics and chemistry from the University of Wisconsin--Eau Claire and was a scientific researcher for The Dow Chemical Company for more than 20 years. In 2005, he was certified to teach physics, chemistry, mathematics and English and subsequently taught mostly high school mathematics for five years. Currently, he enjoys helping SVSU students as a Professional Tutor in the Math and Physics Resource Center. In his spare time, Brian finds joy playing softball, growing roses, reading, camping, and spending time with his wife, Lorelle. Introduction For much of the past two-and-one-half millennia, humans have viewed our geometrical world through the lens of a Euclidian paradigm. Despite knowing that our planet is spherically shaped, math- ematicians have developed the mathematics of non-Euclidian geometry only within the past 200 years. Similarly, only in the past century have mathematicians developed an understanding of such common phenomena as snowflakes, clouds, coastlines, lightning bolts, rivers, patterns in vegetation, and the tra- jectory of molecules in Brownian motion (Peitgen 75).
    [Show full text]
  • Using Fractal Dimensions for Characterizing Intra-Urban Diversity
    A Service of Leibniz-Informationszentrum econstor Wirtschaft Leibniz Information Centre Make Your Publications Visible. zbw for Economics Thomas, Isabelle; Keersmaecker, Marie-Laurence De; Frankhauser, Pierre Conference Paper Using fractal dimensions for characterizing intra- urban diversity. The example of Brussels 43rd Congress of the European Regional Science Association: "Peripheries, Centres, and Spatial Development in the New Europe", 27th - 30th August 2003, Jyväskylä, Finland Provided in Cooperation with: European Regional Science Association (ERSA) Suggested Citation: Thomas, Isabelle; Keersmaecker, Marie-Laurence De; Frankhauser, Pierre (2003) : Using fractal dimensions for characterizing intra-urban diversity. The example of Brussels, 43rd Congress of the European Regional Science Association: "Peripheries, Centres, and Spatial Development in the New Europe", 27th - 30th August 2003, Jyväskylä, Finland, European Regional Science Association (ERSA), Louvain-la-Neuve This Version is available at: http://hdl.handle.net/10419/115977 Standard-Nutzungsbedingungen: Terms of use: Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Documents in EconStor may be saved and copied for your Zwecken und zum Privatgebrauch gespeichert und kopiert werden. personal and scholarly purposes. Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle You are not to copy documents for public or commercial Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich purposes, to exhibit the documents publicly, to make them machen, vertreiben oder anderweitig nutzen. publicly available on the internet, or to distribute or otherwise use the documents in public. Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, If the documents have been made available under an Open gelten abweichend von diesen Nutzungsbedingungen die in der dort Content Licence (especially Creative Commons Licences), you genannten Lizenz gewährten Nutzungsrechte.
    [Show full text]
  • Homeomorphisms of the Sierpinski Carpet
    Bard College Bard Digital Commons Senior Projects Spring 2018 Bard Undergraduate Senior Projects Spring 2018 Homeomorphisms of the Sierpinski Carpet Karuna S. Sangam Bard College, [email protected] Follow this and additional works at: https://digitalcommons.bard.edu/senproj_s2018 Part of the Dynamical Systems Commons, and the Geometry and Topology Commons This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License. Recommended Citation Sangam, Karuna S., "Homeomorphisms of the Sierpinski Carpet" (2018). Senior Projects Spring 2018. 161. https://digitalcommons.bard.edu/senproj_s2018/161 This Open Access work is protected by copyright and/or related rights. It has been provided to you by Bard College's Stevenson Library with permission from the rights-holder(s). You are free to use this work in any way that is permitted by the copyright and related rights. For other uses you need to obtain permission from the rights- holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/or on the work itself. For more information, please contact [email protected]. Homeomorphisms of the Sierpi´nskicarpet A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College by Karuna Sangam Annandale-on-Hudson, New York March, 2018 ii Abstract The Sierpi´nskicarpet is a fractal formed by dividing the unit square into nine congruent squares, removing the center one, and repeating the process for each of the eight remaining squares, continuing infinitely many times. It is a well-known fractal with many fascinating topological properties that appears in a variety of different contexts, including as rational Julia sets.
    [Show full text]
  • Answers to P-Set # 06, 18.385J/2.036J MIT (Fall 2020) Rodolfo R
    Answers to P-Set # 06, 18.385j/2.036j MIT (Fall 2020) Rodolfo R. Rosales (MIT, Math. Dept., room 2-337, Cambridge, MA 02139) November 16, 2020 Contents 1 Bifurcations of a Critical Point for a 1-D map 2 1.1 Statement: Bifurcations of a Critical Point for a 1D map . .2 1.2 Answer: Bifurcations of a Critical Point for a 1D map . .3 2 Sierpinski gasket 5 2.1 Statement: Sierpinski gasket . .5 2.2 Answer: Sierpinski gasket . .6 3 Problem 08.06.03 - Strogatz (Irrational flow yields dense orbits) 11 3.1 Problem 08.06.03 statement . 11 3.2 Problem 08.06.03 answer . 11 4 Problem 08.06.05 - Strogatz (Plotting Lissajous figures) 12 4.1 Problem 08.06.05 statement . 12 4.2 Problem 08.06.05 answer . 12 5 Problem 09.02.02 - Strogatz (Ellipsoidal trapping region for the Lorenz attractor) 13 5.1 Problem 09.02.02 statement . 13 5.2 Problem 09.02.02 answer . 13 6 Problem 09.06.02 - Strogatz (Pecora and Carroll's approach) 14 6.1 Problem 09.06.02 statement . 14 6.2 Problem 09.06.02 answer . 15 7 Problem 14.10.03 - Newton's method in the complex plane 15 7.1 Problem 14.10.03 statement . 15 7.2 Problem 14.10.03 answer . 16 8 Problem 11.03.08 - Strogatz. Sierpinski's carpet 17 8.1 Problem 11.03.08 statement . 17 8.2 Problem 11.03.08 answer . 17 List of Figures 2.1 Sierpinski gasket construction . .5 2.2 Generalizations of the Sierpinski gasket construction .
    [Show full text]
  • Fractint Formula for Overlaying Fractals
    Journal of Information Systems and Communication ISSN: 0976-8742 & E-ISSN: 0976-8750, Volume 3, Issue 1, 2012, pp.-347-352. Available online at http://www.bioinfo.in/contents.php?id=45 FRACTINT FORMULA FOR OVERLAYING FRACTALS SATYENDRA KUMAR PANDEY1, MUNSHI YADAV2 AND ARUNIMA1 1Institute of Technology & Management, Gorakhpur, U.P., India. 2Guru Tegh Bahadur Institute of Technology, New Delhi, India. *Corresponding Author: Email- [email protected], [email protected] Received: January 12, 2012; Accepted: February 15, 2012 Abstract- A fractal is generally a rough or fragmented geometric shape that can be split into parts, each of which is a reduced-size copy of the whole a property called self-similarity. Because they appear similar at all levels of magnification, fractals are often considered to be infi- nitely complex approximate fractals are easily found in nature. These objects display self-similar structure over an extended, but finite, scale range. Fractal analysis is the modelling of data by fractals. In general, fractals can be any type of infinitely scaled and repeated pattern. It is possible to combine two fractals in one image. Keywords- Fractal, Mandelbrot Set, Julia Set, Newton Set, Self-similarity Citation: Satyendra Kumar Pandey, Munshi Yadav and Arunima (2012) Fractint Formula for Overlaying Fractals. Journal of Information Systems and Communication, ISSN: 0976-8742 & E-ISSN: 0976-8750, Volume 3, Issue 1, pp.-347-352. Copyright: Copyright©2012 Satyendra Kumar Pandey, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
    [Show full text]
  • Introduction to Fractals and Scaling Homework for Unit 1: Introduction to Fractals and the Self-Similarity Dimension
    Introduction to Fractals and Scaling Homework for Unit 1: Introduction to Fractals and the Self-Similarity Dimension http://www.complexityexplorer.org Beginner 1. Determine the self-similarity dimension of the Sierpi´nskicarpet, shown in Fig. 1. 2. At step n = 3 in the construction of the Sierpi´nskitriangle, shown in Fig. 2, (a) How many small triangles are there? (b) What is the area of each triangle? (c) What is the total area of the shape? (d) What is the perimeter of each triangle? (e) What is the total perimeter of the shape? 3. The steps in the construction of the Cantor set are shown in Fig. 3. Initially, at n = 0, the line segment has a length of 1. At each step, the middle third of each line segment is removed. Thus, at n = 1, each of the two line segments has a length of 1=3. (a) At n = 2 what is the length of each line segment? (b) At n = 2 how many line segments are there? (c) At n = 2 what is the total length of all the line segments? (d) Determine an expression for the length of each line segment at step n. (e) Determine an expression for the number of line segments at step n. (f) Determine an expression for the total length of all line segments step n. (g) As n gets larger and larger, what happens to the number of line segments? (h) As n gets larger and larger, what happens to the total length of the line segments? 4. Determine the self-similarity dimension of the Cantor set, shown in Fig.
    [Show full text]