Homoclinie intemections are soul.ce of chaos for a map.It is convenient to determine whether a given map iS chaotic or not by computing stable and unstable manifolds of its hyperbolic fixed point and observing if there are homoclinic intersections.A new algorithm is presented to compute one-dimensional stable and unstable manifolds of a map.Inspired by a unique property that derivative is transported along the orbit of one-dimensional manifold.position of new point is located quickly with a two-step "prediction and correction" scheme.Tangent component of the manifold is used as reference line to check if the uew point is acceptable.Performance of the algorithm is demonstrated with several typical chaotic maps.It shows that the algorithm is capable of computing both one- dimensional stable and unstable manifolds of maps.

In order to balance growth rate of manifold in all directions and construct global manifold structure of a dynamical system,a radial control factor is adopted to normalize the original dynamical system.Taking radius component of the tangent vector as a standard,this method controls manifold expanding at same speed in all directions.Theoretical analysis and example calculation demonstrate that manifolds before and after normalization have same orbit with the original one,which means their global manifold structures are consistent.Lorenz and Duffing systems are taken for examples to demonstrate effectiveness of the proposed approach.It indicates that the method not only get same effect as geodesic process but also present manifold in discrete flow way,which avoids many complicated boundary value problems.

With definition of DHT(distinguished hyperbolic trajectory) and existing measure function in phase space,a measure function in extended phase space is presented.Existing algorithms with constant accuracy parameters is laborious as high precision is required.In order to overcome this shortage,a variable-step convergence algorithm is proposed.The main idea is to estimate initial region with the help of ISP(instantaneous stagnation points) and adopt variable-step grids to increase efficiency.With theoretical analysis and numerical calculation,an optimal range of key parameter is given.Two-dimensional and three-dimensional Duffing systems are used to test the performance.It shows that convergence route gained by the developed measure function is smooth and stable.And the variable-step convergence algorithm is more efficient.

With embedding theorem proposed by Takens,we study methods for choosing proper delay time in phase space reconstruction of chaotic time series.A united method to incorporate advantages of average displacement and mutual information is put forward.In mutual information calculation we employ binary tree coding to divide and mark grids which makes it implemented easily.We determine layer numbers according to percentages of sparse grid.Numerical experiments of R ssler and Lorenz systems verifies accaracy of the method.