25 April 2010 in Doklady Mathematics
We propose a method for localizing compact invariant sets of discrete dynamical systems. The method is based on the construction of a localizing set, i.e., the set containing all the invariant compact sets of a discrete system. The properties of localizing sets are described. The method is applied to a onedimen� sional discrete system. Of interest in the qualitative theory of dynamical systems are localization problems, in which the goal is to find subsets of the phase space that possess pre� scribed properties, for example, contain all the com� pact trajectories (stationary points, periodic trajecto� ries, attractors). Such sets are naturally called localiz� ing sets. The resulting localizing set can be used to solve other problems, for example, in the symbolical analysis of a discrete system (1). In this paper, a functional method for localizing invariant compact sets for continuous dynamical sys� tems (2, 3) is extended to discrete dynamical systems. For continuous dynamical systems, this method can be described as follows. Let a dynamical system = f (x), x ∈ � n be given inn . For an arbitrary smooth function ϕ inn , we define where Sϕ = {x ∈ � n : (x) = 0} and (x) is the deriva� tive of ϕ at the point x by virtue of the system = f (x). Then all the invariant compact sets are contained in the localizing set Ωϕ consisting of points at which ϕinf(x) ≤ ϕ(x) ≤ ϕsup. A set G ⊂ � n is said to be positively (negatively) invariant for the system = f (x) if, for any point x0 ∈ G, the solution of the system x(t; x 0 ) with the initial con� x ·
1 June 2011 in Doklady Mathematics
1 December 2011 in Doklady Mathematics
1 October 2010 in Doklady Mathematics