• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.3
• /
• pp.177-182
• /
• 2002

In this paper, we present a mathematical theory and algorithm consoucting some fractal sets. Among such fractal sets, the degree-n bifurcation set as well as the Julia sets is defined by extending the concept of the Mandelbrot set to the complex polynomial $Z^n$+c($c{\epsilon}C$, $n{\ge}2$). Some properties of the degree-n bifurcation set and the Julia sets have been theoretically investigated including the symmetry, periodicity, boundedness, and connectedness. An efficient algorithm constructing both the degree-n bifurcation let and the Julia sets is proposed using theoretical results. The mouse-operated software called "MANJUL" has been developed for the effective construction of the degree-n bifurcation set and the Julia sets in graphic environments with C++ programming language under the windows operating system. Simple mouse operations can construct ann magnify the degree-n bifurcation set as well af the Julia sets. They not only compute the component period but also save the images of the degree-n bifurcation set and the Julia sets to visually confirm various properties and the geometrical structure of the sets. A demonstration has verified the useful versatility of MANJUL.of MANJUL.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.2
• /
• pp.43-57
• /
• 2003

The boundary of a typical period-2 component in the degree-3 bifurcation set is formulated by a parametrization of its image which is the unit circle under the multiplier map. Some properties on the geometry of the boundary are investigated including the root point, the cusp and the length as well as the area bounded by the boundary curve. The centroid of the area for the period-2 component was numerically found with high accuracy and compared with its center. An algorithm drawing the boundary curve with Mathematica codes is proposed and its implementation exhibits a good agreement with the analysis presented here.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.5.3-5
• /
• 2003

The boundary of a typical period-2 component in the degree-3 bifurcation set is formulated by a parametrization of its image which is the unit circle under the multiplier map, Some properties on the geometry of the boundary are investigated including the root point, the cusp, the component center and the length as well as the area bounded by the boundary curve. An algorithm drawing the boundary curve with Mathematica codes is proposed and its implementation exhibits a good agreement with the analysis presented here.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.677-690
• /
• 2020

In this article, we study a reaction-diffusion system with homogeneous Dirichlet boundary conditions, which describing a three-species food chain model. Under some conditions, the predator-prey subsystem (u₁ ≡ 0) has a unique positive solution (${\bar{u_2}}$, ${\bar{u_3}}$). By using the birth rate of the prey r1 as a bifurcation parameter, a connected set of positive solutions of our system bifurcating from semi-trivial solution set (r₁, (0, ${\bar{u_2}}$, ${\bar{u_3}}$)) is obtained. Results are obtained by the use of degree theory in cones and sub and super solution techniques.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.109-118
• /
• 2007

A parametric boundary equation is established for the principal period-2 bulb in the cubic Mandelbrot set. Using its geometry, an efficient escape-time algorithm which reduces the construction time for the period-2 bulbs in the cubic Mandelbrot set is introduced and the implementation graphic results display the fascinating fractal beauty.

• The Pure and Applied Mathematics
• /
• v.14 no.3
• /
• pp.191-196
• /
• 2007

The main components in the generalized Mandelbrot sets are under a theoretical investigation for their parametric boundary equations. Using the boundary geometries, a fast construction algorithm is introduced for the generalized Mandelbrot set. This fast algorithm definitely reduces the construction CPU time in comparison with the naive algorithm. Its graphic implementation displays the mysterious and beautiful fractal sets.