An algorithm to approach invariant curves (Q5932055)

For a dynamical system, the bifurcation diagram from steady-state solutions can be smoothly developed by the local theory and the continuation method. But a further continuation from a branch of periodic solutions to a new branch of quasi-periodic ones is always a very difficult problem, mainly for high-dimensional systems. There are two key problems to be solved: to search for a proper starting point for the new branch and to find out the corresponding quasi-periodic solution for each parameter in the new branch. An algorithm to identify invariant curves efficiently is developed. In the case of dynamical systems it solves the above problem, that is to do continuations of branches of quasi-periodic solutions smoothly in bifurcation diagrams. Several numerical examples are presented.