.png){kind=icon}
返回
Computing connecting orbits via an improved algorithm for continuing invariant subspaces
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827598344868.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
connecting orbits
invariant subspaces
bifurcations
numerical continuation
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Simulation Model of the Population Dynamics of
Ostrinia nubilalis
(Lepidoptera: Pyralidae) in Maize
PREAI
分享收藏Pro → Ala‐35 Rhodobacter capsulatus cytochrome c2 shows dynamic not structural differences.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏
An approach of service modeling for the demand-driven implementation of Human-Robot-Interaction in manufacturing一种面向按需驱动的制造中人机交互实施的服务建模方法
PREAI
分享收藏Large magnetocaloric effect in manganese perovskite La0.67−xBixBa0.33MnO3 near room temperatureRSC AdvancesOAAI
RSC AdvancesIF0
OAAI分享收藏 没有更多内容
没有更多内容