Continuation of Connecting orbits in 3D-ODES (II) : Cycle-to-Cycle Connections

نویسندگان

  • Eusebius J. Doedel
  • B. W. Kooi
  • G. A. K. van Voorn
  • Yuri A. Kuznetsov
چکیده

In Part I of this paper we discussed new methods for the numerical continuation of point-tocycle connecting orbits in 3-dimensional autonomous ODE’s using projection boundary conditions. In this second part we extend the method to the numerical continuation of cycle-to-cycle connecting orbits. In our approach, the projection boundary conditions near the cycles are formulated using eigenfunctions of the associated adjoint variational equations, avoiding costly and numerically unstable computations of the monodromy matrices. The equations for the eigenfunctions are included in the defining boundary-value problem, allowing a straightforward implementation in auto, in which only the standard features of the software are employed. Homotopy methods to find the connecting orbits are discussed in general and illustrated with an example from population dynamics. Complete auto demos, which can be easily adapted to any autonomous 3-dimensional ODE system, are freely available.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuation of Connecting orbits in 3D-ODES (I): Point-to-Cycle Connections

This AUTO demo shows the use of a set of boundary conditions for the localization and continuation of the transcritical bifurcation of a limit cycle in a four-dimensional Marr-Pirt model.

متن کامل

D ec 2 00 7 CONTINUATION OF CONNECTING ORBITS IN 3 D - ODES : ( I ) POINT - TO - CYCLE CONNECTIONS

We propose new methods for the numerical continuation of point-to-cycle connecting orbits in 3-dimensional autonomous ODE's using projection boundary conditions. In our approach, the projection boundary conditions near the cycle are formulated using an eigenfunction of the associated adjoint variational equation, avoiding costly and numerically unstable computations of the monodromy matrix. The...

متن کامل

An e cient algorithm for locating and continuing connecting orbits

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [9]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a new algorithm for the continuation of invariant subspaces based on iterative re nement techniques.

متن کامل

An Eecient Algorithm for Locating and Continuing Connecting Orbits

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in 9]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a new algorithm for the continuation of invariant subspaces. The latter algorithm is of independent interest, and can be used in diierent contexts than the pre...

متن کامل

Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces

A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [10]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a new algorithm for the continuation of invariant subspaces. The latter algorithm is of independent interest, and can be used in different contexts than the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Bifurcation and Chaos

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2009