The simplest normal form of Hopf bifurcation

Recently, further reduction on normal forms of differential equations leading to the simplest normal forms (SNFs) has received considerable attention. However, the computation of the SNF has been mainly restricted to systems which do not contain perturbation parameters (unfolding), since the computation of the SNF with unfolding is much more complicated than that of the SNF without unfolding. From the practical point of view, only the SNF with perturbation (bifurcation) parameters is useful in analysing physical or engineering problems. It is shown that the SNF with unfolding cannot be obtained using only near-identity transformation. Additional transformations such as time and parameter rescaling need to be introduced. An efficient computational method is presented for computing the algebraic equations that can be used to find the SNF. A physical example is given to show the applicability of the new method.