An efficient algorithm for locating and continuing connecting orbits
J. W. Demmel, L. Dieci, M. J. Friedman
Abstract
A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [9]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a new algorithm for the continuation of invariant subspaces. The latter algorithm is of independent interest, and can be used in different contexts than the present one.
Create a lesson
Related papers
A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations
Floris van Doorn, Polona Durcik, Joris Roos et al.
On some aspects of discrete groups acting ergodically on the boundary
Subhadip Dey, Mikołaj Frączyk, Sebastian Hurtado
A Structural Theory of Admissible Transitions in Biological Reaction Networks
Stephan Peter, Bashar Ibrahim
Sequential and distributive dual futile cycle: Hopf bifurcation can occur under parameter-rich kinetics but cannot occur under mass action kinetics
Nicola Vassena
Rigidity on the two-torus and Sarnak's conjecture
Yinshan Chang, Jian Wang, Junchang Zhou
Linear response for random systems with a cusp
Davrbek Oltiboev, Karim Rakhimov, Marks Ruziboev