|国家预印本平台
首页|From Hopf to Neimark-Sacker bifurcation: a computational algorithm

From Hopf to Neimark-Sacker bifurcation: a computational algorithm

From Hopf to Neimark-Sacker bifurcation: a computational algorithm

来源:Arxiv_logoArxiv
英文摘要

We construct an algorithm for approximating the invariant tori created at a Neimark-Sacker bifurcation point. It is based on the same philosophy as many algorithms for approximating the periodic orbits created at a Hopf bifurcation point, i.e. a Fourier spectral method. For Neimark-Sacker bifurcation, however, we use a simple parametrisation of the tori in order to determine low-order approximations, and then utilise the information contained therein to develop a more general parametrisation suitable for computing higher-order approximations. Different algorithms, applicable to either autonomous or periodically-forced systems of differential equations, are obtained.

Gerald Moore

数学

Gerald Moore.From Hopf to Neimark-Sacker bifurcation: a computational algorithm[EB/OL].(2007-11-09)[2025-05-07].https://arxiv.org/abs/0711.1505.点此复制

评论