Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces
نویسندگان
چکیده
A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [10]. 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.
منابع مشابه
An e cient algorithm for locating and continuing connecting orbits
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 based on iterative re nement techniques.
متن کاملAn Eecient Algorithm for Locating and Continuing Connecting Orbits
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 diierent contexts than the pre...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملPoint-to-periodic and Periodic-to-periodic Connections
In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn [5] where a numerical technique is also proposed. Our algorithms consist of s...
متن کاملSymmetry and Orbit Detection via Lie-Algebra Voting
In this paper, we formulate an automatic approach to the detection of partial, local, and global symmetries and orbits in arbitrary 3D datasets. We improve upon existing voting-based symmetry detection techniques by leveraging the Lie group structure of geometric transformations. In particular, we introduce a logarithmic mapping that ensures that orbits are mapped to linear subspaces, hence uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2000