Defining Functions for Multiple Hopf Bifurcations
- 1 June 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 34 (3) , 1269-1288
- https://doi.org/10.1137/s0036142995282182
Abstract
Let $A(u,\alpha)=F_u(u,\alpha)$ ($u \in R^n, \alpha \in R^k$) be a family of real $n \times n$ matrices arising as the Jacobian matrices of equilibrium solutions to the dynamical system $ \stackrel{.}{u}=F(u,\alpha)$. An equilibrium point is called a Hopf point if A has a conjugate pair of pure imaginary eigenvalues $\pm i\omega$, $\omega> 0$. It is called a double Hopf point if there are two such pairs $\pm i\omega_1, \pm i\omega_2$ and a 1:1 resonant double Hopf point if, in addition, $\omega_1=\omega_2$. Defining functions are obtained for the numerical detection, computation, and continuation of Hopf, double Hopf, and 1:1 resonant double Hopf points. They are based on a combination of matrix biproduct and bordered matrix methods. Example computations are done in a fairly realistic and complicated neural model problem with $n=13$ and $k=29$. However, to make the methods applicable to large-scale problems (e.g., discretized boundary value problems) we reduce the state space to a subspace that essentially contains the generalized eigenspaces of the eigenvalues with largest real part.
Keywords
This publication has 21 references indexed in Scilit:
- BORDERED MATRICES AND SINGULARITIES OF LARGE NONLINEAR SYSTEMSInternational Journal of Bifurcation and Chaos, 1995
- Mixed block elimination for linear systems with wider bordersIMA Journal of Numerical Analysis, 1993
- Regularization and computation of a bifurcation problem with corank 2Computing, 1989
- Computation of cusp singularities for operator equations and their discretizationsJournal of Computational and Applied Mathematics, 1989
- Singularities and Groups in Bifurcation TheoryPublished by Springer Nature ,1988
- Singularities and Groups in Bifurcation TheoryPublished by Springer Nature ,1985
- New algorithms for the evaluation of complex bifurcation points in ordinary differential equations. a comparative numerical studyApplied Mathematics and Computation, 1984
- Newton-Like Pseudo-Arclength Methods for Computing Simple Turning PointsSIAM Journal on Scientific and Statistical Computing, 1984
- Characterization and Computation of Generalized Turning PointsSIAM Journal on Numerical Analysis, 1984
- Multiple limit point bifurcationJournal of Mathematical Analysis and Applications, 1980