Abstract
Extreme modulus escaping time algorithm, decomposition algorithm and fisheye algorithm are analyzed in this thesis, and we construct a series of generalized Mandelbrot-Julia (M-J) sets using these three algorithms. By studying the structural character of generalized M-J sets, we find: (1) extreme modulus escaping time algorithm and decomposition algorithm are simple modifications of classic escaping time algorithm, they can both construct the structure of non-boundary areas of generalized M-J sets; (2) non-boundary areas of generalized M-J sets have fractal characters; (3) generalized M-J sets have symmetry, and the process of evolvement depends on range of phase angle; (4) we can observe not only the whole structure of generalized Mandelbrot sets but also the details of some parts by using fisheye algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
