Numerical determination of the basin of attraction for exponentially asymptotically autonomous dynamical systems

Numerical methods to determine the basin of attraction for autonomous equations focus on a bounded subset of the phase space. For non-autonomous systems, any relevant subset of the phase space, which now includes the time as one coordinate, is unbounded in the t-direction. Hence, a numerical method would have to use infinitely many points.To overcome this problem, we introduce a transformation of the phase space. Restricting ourselves to exponentially asymptotically autonomous systems, we can map the infinite time interval to a finite, compact one. The basin of attraction of a solution becomes the basin of attraction of an exponentially stable equilibrium for an autonomous system. Now we are able to generalise numerical methods from the autonomous case. More precisely, we characterise a Lyapunov function as a solution of a suitable linear first-order partial differential equation and approximate it using radial basis functions.     

Anderson localization for the discrete one-dimensional quasi-periodic Schrödinger operator with potential defined by a Gevrey-class function

In this paper we consider the discrete one-dimensional Schrödinger operator with quasi-periodic potential v_n=λv(x+nω). We assume that the frequency ω satisfies a strong Diophantine condition and that the function v belongs to a Gevrey class, and it satisfies a transversality condition. Under these assumptions we prove—in the perturbative regime—that for large disorder λ and for most frequencies ω the operator satisfies Anderson localization. Moreover, we show that the associated Lyapunov exponent is positive for all energies, and that the Lyapunov exponent and the integrated density of states are continuous functions with a certain modulus of continuity. We also prove a partial nonperturbative result assuming that the function v belongs to some particular Gevrey classes.     

Multifractal analysis of divergence points of deformed measure theoretical Birkhoff averages. IV: Divergence points and packing dimension

During the past 10 years multifractal analysis has received an enormous interest. For a sequence n(φn) of functions on a metric space X, multifractal analysis refers to the study of the Hausdorff and/or packing dimension of the level sets(1) of the limit function limnφn. However, recently a more general notion of multifractal analysis, focusing not only on points x for which the limit limnφn(x) exists, has emerged and attracted considerable interest. Namely, for a sequence n(xn) in a metric space X, we let A(xn) denote the set of accumulation points of the sequence n(xn). The problem of computing that the Hausdorff dimension of the set of points x for which the set of accumulation points of the sequence (φnn(x)) equals a given set C, i.e. computing the Hausdorff dimension of the set(2){x∈X|A(φn(x))=C} has recently attracted considerable interest and a number of interesting results have been obtained. However, almost nothing is known about the packing dimension of sets of this type except for a few special cases investigated in [I.S. Baek, L. Olsen, N. Snigireva, Divergence points of self-similar measures and packing dimension, Adv. Math. 214 (2007) 267–287]. The purpose of this paper is to compute the packing dimension of those sets for a very general class of maps φn, including many examples that have been studied previously, cf. Theorem 3.1 and Corollary 3.2. Surprisingly, in many cases, the packing dimension and the Hausdorff dimension of the sets in (2) do not coincide. This is in sharp contrast to well-known results in multifractal analysis saying that the Hausdorff and packing dimensions of the sets in (1) coincide.     

The Julia sets of quadratic Cremer polynomials

We study the topology of the Julia set of a quadratic Cremer polynomial P. Our main tool is the following topological result. Let be a homeomorphism of a plane domain U and let T⊂U be a non-degenerate invariant non-separating continuum. If T contains a topologically repelling fixed point x with an invariant external ray landing at x, then T contains a non-repelling fixed point. Given P, two angles θ,γ are K-equivalent if for some angles x₀=θ,…,xn=γ the impressions of xi−1 and xi are non-disjoint, 1?i?n; a class of K-equivalence is called a K-class. We prove that the following facts are equivalent: (1) there is an impression not containing the Cremer point; (2) there is a degenerate impression; (3) there is a full Lebesgue measure dense Gδ-set of angles each of which is a K-class and has a degenerate impression; (4) there exists a point at which the Julia set is connected im kleinen; (5) not all angles are K-equivalent.     

Investigating derivatives by means of combinatorial analysis of the components of the function

Given a composite function of the form h(x) = f(g(x)), difficulties are often encountered in calculating the value of the nth derivative at some point x = x₀ when one attempts to determine whether its nth derivative becomes zero at this point, or attempts to find the sign of the nth derivative by differentiating it n times and substituting x₀.

This present paper offers an alternative method that allows the investigation of the nth derivative of function h(x) based on the investigation of functions f?(x) and g(x) only.

Several examples are given, which implement the conclusions on the properties of the relation.     

Asymptotic expansions and acceleration of convergence for higher order iteration processes

Summary We analyze the convergence behavior of sequences of real numbers {x _n }, which are defined through an iterative process of the formx _n :=T(x _n –1), whereT is a suitable real function. It will be proved that under certain mild assumptions onT, these numbersx _n possess an asymptotic (error) expansion, where the type of this expansion depends on the derivative ofT in the limit point ; this generalizes a result of G. Meinardus [6].It is well-known that the convergence of sequences, which possess an asymptotic expansion, can be accelerated significantly by application of a suitable extrapolation process. We introduce two types of such processes and study their main properties in some detail. In addition, we analyze practical aspects of the extrapolation and present the results of some numerical tests. As we shall see, even the convergence of Newton's method can be accelerated using the very simple linear extrapolation process.Dedicated to Professor Dr. Günter Meinardus on the occasion of his 65^th birthday     

On minimal decomposition of p-adic polynomial dynamical systems

A polynomial of degree ?2 with coefficients in the ring of p-adic numbers Zp is studied as a dynamical system on Zp. It is proved that the dynamical behavior of such a system is totally described by its minimal subsystems. For an arbitrary quadratic polynomial on Z₂, we exhibit all its minimal subsystems.     

On the determination of the basin of attraction of periodic orbits in three- and higher-dimensional systems

The determination of the basin of attraction of a periodic orbit can be achieved using a Lyapunov function. A Lyapunov function can be constructed by approximation of a first-order linear PDE for the orbital derivative via meshless collocation. However, if the periodic orbit is only accessible numerically, a different method has to be used near the periodic orbit. Borg's criterion provides a method to obtain information about the basin of attraction by measuring whether adjacent solutions approach each other with respect to a Riemannian metric. Using a numerical approximation of the periodic orbit and its first variation equation, a suitable Riemannian metric is constructed.     

Global asymptotic stability for damped half-linear oscillators

A necessary and sufficient condition is established for the equilibrium of the oscillator of half-linear type with a damping term, (?_p(x^′))^′+h(t)?_p(x^′)+?_p(x)=0 to be globally asymptotically stable. The obtained criterion is given by the form of a certain growth condition of the damping coefficient h(t) and it can be applied to not only the cases of large damping and small damping but also the case of fluctuating damping. The presented result is new even in the linear cases (p=2). It is also discussed whether a solution of the half-linear differential equation (r(t)?_p(x^′))^′+c(t)?_p(x)=0 that converges to a non-zero value exists or not. Some suitable examples are included to illustrate the results in the present paper.     

Stability and convergence in discrete convex monotone dynamical systems

We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is weaker than Lyapunov stability. Among others we show that the set of tangentially stable fixed points is isomorphic to a convex inf-semilattice, and a criterion is given for the existence of a unique tangentially stable fixed point. We also show that periods of tangentially stable periodic points are orders of permutations on n letters, where n is the dimension of the underlying space, and a sufficient condition for global convergence to periodic orbits is presented.     

Convex Minimization over the Fixed Point Set of Demicontractive Mappings

This paper deals with a viscosity iteration method, in a real Hilbert space , for minimizing a convex function over the fixed point set of , a mapping in the class of demicontractive operators, including the classes of quasi-nonexpansive and strictly pseudocontractive operators. The considered algorithm is written as: x _n+1 := (1 − w) v _n + w T v _n , v _n := x _n − α _n Θ′(x _n ), where w ∈ (0,1) and , Θ′ is the Gateaux derivative of Θ. Under classical conditions on T, Θ, Θ′ and the parameters, we prove that the sequence (x _n ) generated, with an arbitrary , by this scheme converges strongly to some element in Argmin _Fix(T) Θ.      

On the chaotic behavior of a generalized logistic p-adic dynamical system

In the paper we describe basin of attraction p-adic dynamical system G(x)=(ax)²(x+1). Moreover, we also describe the Siegel discs of the system, since the structure of the orbits of the system is related to the geometry of the p-adic Siegel discs.     

Boundedness and Stability for Higher Order Difference Equations*

Sufficient conditions are given under which the higher order difference equation x _n+1= f(x _n,x _n-1,...,x_n-k ), n=0,1,2,... generates an order preserving discrete dynamical system with respect to the discrete exponential ordering. It is shown that under the above monotonicity assumption the boundedness of all solutions as well as the local and global stability of an equilibrium hold if and only if they hold for the much simpler first order equation x _n+1=h(x _n ), where h(x)=f(x,x,…,x). As an application, a second order nonlinear difference equation from macroeconomics and a discrete analogue of a model of haematopoiesis are discussed.     

Lyapunov exponents,bifurcation currents and laminations in bifurcation loci

Bifurcation loci in the moduli space of degree d rational maps are shaped by the hypersurfaces defined by the existence of a cycle of period n and multiplier 0 or e ^iθ. Using potential-theoretic arguments, we establish two equidistribution properties for these hypersurfaces with respect to the bifurcation current. To this purpose we first establish approximation formulas for the Lyapunov function. In degree d = 2, this allows us to build holomorphic motions and show that the bifurcation locus has a lamination structure in the regions where an attracting basin exists.     

A hybrid method for computing Lyapunov exponents

In this paper we propose a numerical method for computing all Lyapunov coefficients of a discrete time dynamical system by spatial integration. The method extends an approach of Aston and Dellnitz (Comput Methods Appl Mech Eng 170:223–237, 1999) who use a box approximation of an underlying ergodic measure and compute the first Lyapunov exponent from a spatial average of the norms of the Jacobian for the iterated map. In the hybrid method proposed here, we combine this approach with classical QR-oriented methods by integrating suitable R-factors with respect to the invariant measure. In this way we obtain approximate values for all Lyapunov exponents. Assuming somewhat stronger conditions than those of Oseledec’ multiplicative theorem, these values satisfy an error expansion that allows to accelerate convergence through extrapolation. W.-J. Beyn and A. Lust was supported by CRC 701 ‘Spectral Analysis and Topological Methods in Mathematics’. The paper is mainly based on the PhD thesis [27] of A. Lust.     

Realization of all Dold's congruences with stability

The main goal of this paper is to prove that for each n>2, every sequence of integers satisfying Dold's congruences is realized as the sequence of fixed point indices of the iterates of an orientation preserving Rn-homeomorphism at an isolated stable fixed point. We use Conley index techniques even though stable fixed points are not isolated invariant sets.     

Fibonacci-type polynomial as a trajectory of a discrete dynamical system

Families of polynomials which obey the Fibonacci recursion relation can be generated by repeated iterations of a 2×2 matrix,Q ₂, acting on an initial value matrix,R ₂. One matrix fixes the recursion relation, while the other one distinguishes between the different polynomial families. Each family of polynomials can be considered as a single trajectory of a discrete dynamical system whose dynamics are determined byQ ₂. The starting point for each trajectory is fixed byR ₂(x). The forms of these matrices are studied, and some consequences for the properties of the corresponding polynomials are obtained. The main results generalize to the so-calledr-Bonacci polynomials.     

On open problems concerning distributional chaos for triangular maps

We show that in the class T of the triangular maps (x,y)?(f(x),g_x(y)) of the square there is a map of type 2^∞ with non-minimal recurrent points which is not DC3. We also show that every DC1 continuous map of a compact metric space has a trajectory which cannot be (weakly) approximated by trajectories of compact periodic sets. These two results make possible to answer some open questions concerning classification of maps in T with zero topological entropy, and contribute to an old problem formulated by A.N. Sharkovsky.     

Convergence of Ishikawa’s iteration method for pseudocontractive mappings

Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let T_i:C→C,i=1,2,…,N, be a finite family of Lipschitz pseudocontractive mappings. It is our purpose, in this paper, to prove strong convergence of Ishikawa’s method to a common fixed point of a finite family of Lipschitz pseudocontractive mappings provided that the interior of the common fixed points is nonempty. No compactness assumption is imposed either on T or on C. Moreover, computation of the closed convex set C_n for each n≥1 is not required. The results obtained in this paper improve on most of the results that have been proved for this class of nonlinear mappings.     

An algorithm of MCMC method for solving F(X) =0

An algorithm of continuous stage-space MCMC method for solving algebra equation f(x)=0 is given. It is available for the case that the sign of f(x) changes frequently or the derivative f′(x) does not exist in the neighborhood of the root, while the Newton method is hard to work. Let n be the number of random variables created by computer in our algorithm. Then after m=O(n) transactions from the initial value x ₀,x* can be got such that |f(x*)|<e ^−cm |f(x ₀)| by choosing suitable positive constant c. An illustration is also given with the discussion of convergence by adjusting the parameters in the algorithm. Supported by the National Natural Science Foundation of China (70171008).