Omid Ashtari, Tobias M. Schneider

Jacobian-free variational method for computing connecting orbits in nonlinear dynamical systems

  • Applied Mathematics
  • General Physics and Astronomy
  • Mathematical Physics
  • Statistical and Nonlinear Physics
Save to CiteDrive Show PDF

One approach for describing spatiotemporal chaos is to study the unstable invariant sets embedded in the chaotic attractor of the system. While equilibria, periodic orbits, and invariant tori can be computed using existing methods, the numerical identification of heteroclinic and homoclinic connections between them remains challenging. We propose a robust matrix-free variational method for computing connecting orbits between equilibrium solutions. Instead of a common shooting-based approach, we view the identification of a connecting orbit as a minimization problem in the space of smooth curves in the state space that connect the two equilibria. In this approach, the deviation of a connecting curve from an integral curve of the vector field is penalized by a non-negative cost function. Minimization of the cost function deforms a trial curve until, at a global minimum, a connecting orbit is obtained. The method has no limitation on the dimension of the unstable manifold at the origin equilibrium and does not suffer from exponential error amplification associated with time-marching a chaotic system. Owing to adjoint-based minimization techniques, no Jacobian matrices need to be constructed. Therefore, the memory requirement scales linearly with the size of the problem, allowing the method to be applied to high-dimensional dynamical systems. The robustness of the method is demonstrated for the one-dimensional Kuramoto–Sivashinsky equation.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive