A convergence-improving iterative method for computing periodic orbits near bifurcation points

From MaRDI portal





An iterative method for computing periodic orbits is presented. It computes, to any desired accuracy, the coefficients of their Fourier series expansions. The method represents a definite improvement over an iterative-variational method introduced by \textit{C. R. Eminhizer}, \textit{R. H. G. Helleman} and \textit{E. W. Montroll} [J. Math. Phys. 17, 121-140 (1976; MR52{\#}9741)] and \textit{R. H. G. Helleman} and the second author [Lect. Notes Phys. 93, 353-375 (1979; Zbl 0404.70020)]. The new method of ``root-searching is not affected by a Jacobian taking small values between neighboring roots as is the case for Newton's method. This method is illustrated on the conservative nonlinear Mathieu equation determining the first few bifurcations of period \(2^ k\) orbits, \(k=1,2,3,..\). Universal constants are also computed.











This page was built for publication: A convergence-improving iterative method for computing periodic orbits near bifurcation points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q917231)