.png){kind=icon}
Return
Computing connecting orbits via an improved algorithm for continuing invariant subspaces
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827598344868.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [Numer. Algorithms, 14 (1997), pp. 103-124]. 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 contexts different than the present one.
Keywords:
connecting orbits
invariant subspaces
bifurcations
numerical continuation
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
Simulation Model of the Population Dynamics of
Ostrinia nubilalis
(Lepidoptera: Pyralidae) in Maize
PREAI
ShareSavePro → Ala‐35 Rhodobacter capsulatus cytochrome c2 shows dynamic not structural differences.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAIShareSave
ShareSaveShareSaveShareSaveLarge magnetocaloric effect in manganese perovskite La0.67−xBixBa0.33MnO3 near room temperatureRSC AdvancesOAAI
RSC AdvancesIF0
OAAIShareSave no more
no more