Numeric characteristics of generalized M-set with its asymptote

Liu, Shuai, Cheng, Xiaochun ORCID logoORCID:, Fu, Weina, Zhou, Yunpeng and Li, Qianzhong (2014) Numeric characteristics of generalized M-set with its asymptote. Applied Mathematics and Computation, 243 . pp. 767-774. ISSN 0096-3003 [Article] (doi:10.1016/j.amc.2014.06.016)


The Mandelbrot set (M-set) formulated by fc(z) = z2 + c is important in chaos theory. It has been extended into generalized M set (k-M set) fc(z) = zk + c by using different exponent k. The escape time algorithm is used to draw fractals, which need preset thresholds and a maximum iteration times as input. This paper presents and proves the upper and lower bounds of generalized M set thresholds. A new method is also introduced to draw k-M set when k is a rational number. This method uses asymptotes of k-M set to approach k-M set from the outside. We prove that k-M set is the limit of these asymptotes. Finally, some experiments are presented to validate our methods.

Item Type: Article
Keywords (uncontrolled): Fractal; Mandelbrot set; Generalized Mandelbrot set; Rational exponent; Asymptote
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 24585
Useful Links:
Depositing User: Xiaochun Cheng
Date Deposited: 09 Jul 2018 17:56
Last Modified: 14 Mar 2021 19:13

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.