Numerical Algorithms for Nonlinear Dynamics
&
Existing Program Implementations

Software for bifurcation analysis
Bifurcation analysis capabilities

SGTND main    : :    Algorithms and Programms    : :    Software for bifurcation analysis    : :    Basic features

russian      noframes
frames  

Basic features of several packages for bifurcation analysis

(based on the table ftom the lecture slides by Yury A. Kuznetsov at Heidelberg)

 

AUTO

СONTENT

Matcont

CANDYS/QA

JANET

time-integration

 

+

+

+

+

Poincare maps

 

 

+

+

+

continuation of equilibria

+

+

+

+

+

detection of branch points and codim 1 bifurcations (limit and Hopf points) of equilibria

+

+

+

+

+

computation of normal forms for codim 1 bifurcations of equilibria

 

+

+

1)

continuation of codim 1 bifurcations of equilibria

+

+

+

+

+

detection of codim 2 equilibrium bifurcations
(cusp, Bogdanov-Takens, fold-Hopf, generalized and double Hopf)

 

+

+

+

continuation of limit cycles

+

+

+

+

+

detection of branch points and codim 1 bifurcations
(limit points, flip and Neimark-Sacker (torus)) of cycles

+

+

+

+

+

continuation of codim 1 bifurcations of cycles

+

 

+

+

+

branch switching at equilibrium and cycle bifurcations

+

+

+

+

continuation of branching points of equilibria and cycles

 

 

+

?

?

computation of normal forms for codim 1 bifurcations of cycles

 

 

+

1)

detection of codim 2 bifurcations of cycles

 

 

+

+

continuation of orbits homoclinic to equilibria

+

 

+ 

 

1)Normal forms are computed for simple bifurcations, e.g. folds and flip. For a fold it makes possible to distinguish cusps. For a flip the coefficient is computed defining the degeneracy condition, making possible to distinguish between subcritical and supercritical bifurcations.