Premium
An algorithm for the computation of multiple Hopf bifurcation points based on Pade approximants
Author(s) -
Girault G.,
Guevel Y.,
Cadou J.M.
Publication year - 2011
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.2605
Subject(s) - mathematics , hopf bifurcation , maxima and minima , computation , padé approximant , bifurcation , bifurcation theory , newton's method , convergence (economics) , numerical analysis , robustness (evolution) , algorithm , mathematical analysis , nonlinear system , physics , biochemistry , chemistry , quantum mechanics , economics , gene , economic growth
SUMMARY Recently, a numerical method was proposed to compute a Hopf bifurcation point in fluid mechanics. This numerical method associates a bifurcation indicator and a Newton method. The former gives initial guesses to the iterative method. These initial values are the minima of the bifurcation indicator. However, sometimes, these minima do not lead to the convergence of the Newton method. Moreover, as only a single initial guess is obtained for each computation of the indicator, the computational time to obtain a Hopf bifurcation point can be quite long. The present algorithm is an enhancement of the previous one. It consists in automatically computing several initial guesses for each indicator curve. The majority of these initial values leads to the convergence of the Newton method. This method is evaluated through the problem of the lid‐driven cavity with several aspect ratios in the framework of the finite element analysis of the 2D Navier–Stokes equations. The results prove the efficiency and the robustness of the proposed algorithm. Copyright © 2011 John Wiley & Sons, Ltd.