Simulated annealing algorithm for finding periodic orbits

Adaptation of the simulated annealing algorithm for the determination of periodic orbits.
Updated 27 Feb 2012

View License

In [CNSNS 16, 2845 (2011)] we propose a method which extends this basin of attraction of standard Newton-based methods to determine periodic orbits by use of systematized trial and error converging procedure. In order to do that, we combine a deterministic algorithm with a Simulated Annealing algorithm to approximate the periodic orbits. In other words, the goal of this stochastic method is to enable the determination of initial guesses with sufficient accuracy to lay them into the basin of attraction of a fast converging algorithm like the Newton-Raphson algorithm. As a consequence of the underlying stochastic nature of the algorithm, it enables one to determine several different periodic orbits for the considered dynamical system by launching the algorithm several times.

The present program corresponds to the algorithm presented and used in the reference. The function "SA_He_PO.m" serves as a test case to illustrate the feasibility of the method and the success of the algorithm in finding periodic orbits. The considered example describes a two degree of freedom atomic model.

Cite As

Mauger François (2024). Simulated annealing algorithm for finding periodic orbits (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2007a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes