From Hopf to Neimark-Sacker bifurcation: A computational algorithm (Q1040628)

From MaRDI portal
scientific article
Language Label Description Also known as
English
From Hopf to Neimark-Sacker bifurcation: A computational algorithm
scientific article

    Statements

    From Hopf to Neimark-Sacker bifurcation: A computational algorithm (English)
    0 references
    0 references
    25 November 2009
    0 references
    Summary: 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.
    0 references
    Neimark-Sacker bifurcation
    0 references
    Hopf bifurcation
    0 references
    Fourier spectral method
    0 references
    normal form
    0 references
    Floquet theory
    0 references
    invariant tori
    0 references
    differential equations
    0 references
    numerical examples
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references