Search

Escape time algorithm is a classical algorithm to calculate the Julia sets, but it has the disadvantage of dull color and cannot record the iterative process of the points. In this paper, we present the equipotential point algorithm to calculate the Julia sets by recording the strike frequency of the points in the iterative process. We calculate and analyze the Julia sets in the complex plane by using this algorithm. Finally, we discuss the iteration trajectory of a single point. [ABSTRACT FROM AUTHOR]

In this paper, we first establish a rational iteration method which can be used as a root-finding algorithm for almost every polynomial. It has no nonrepelling extraneous fixed point in the complex plane and is generally convergent for both quadratic and cubic polynomials. Then some properties of this algorithm are given. By the aid of computer, we produce pictures of the Julia sets for the iterations of some polynomials. Numerical results show that it is a root-finding method with convergence order the same as Halley's method. [ABSTRACT FROM AUTHOR]

In this paper we describe several new types of invariant sets that appear in the Julia sets of the complex exponential functions Eλ(z) = λez where λ ∈ ℂ in the special case when λ is a Misiurewicz parameter, so that the Julia set of these maps is the entire complex plane. These invariant sets consist of points that share the same itinerary under iteration of Eλ. Previously, the only known types of such invariant sets were either simple hairs that extend from a definite endpoint to ∞ in the right half plane or else indecomposable continua for which a single hair accumulates everywhere upon itself. One new type of invariant set that we construct in this paper is an indecomposable continuum in which a pair of hairs accumulate upon each other, rather than a single hair having this property. The second type consists of an indecomposable continuum together with a completely separate hair that accumulates on this continuum. [ABSTRACT FROM AUTHOR]

We consider the family of entire transcendental maps given by F[sub λ,m](z)=λz[sup m]exp(z) where m≥2. All functions F[sub λ,m] have a superattracting fixed point at z=0, and a critical point at z = -m. In the dynamical plane we study the topology of the basin of attraction of z=0. In the parameter plane we focus on the capture behavior, i.e. λ values such that the critical point belongs to the basin of attraction of z=0. In particular, we find a capture zone for which this basin has a unique connected component, whose boundary is then nonlocally connected. However, there are parameter values for which the boundary of the immediate basin of z=0 is a quasicircle. [ABSTRACT FROM AUTHOR]