A Survey of Methods for Computing (un)Stable Manifolds of Vector Fields
نویسندگان
چکیده
The computation of global invariant manifolds has seen renewed interest in recent years. We survey different approaches for computing a global stable or unstable manifold of a vector field, where we concentrate on the case of a two-dimensional manifold. All methods are illustrated with the same example — the two-dimensional stable manifold of the origin in the Lorenz system.
منابع مشابه
Two-dimensional global manifolds of vector fields.
We describe an efficient algorithm for computing two-dimensional stable and unstable manifolds of three-dimensional vector fields. Larger and larger pieces of a manifold are grown until a sufficiently long piece is obtained. This allows one to study manifolds geometrically and obtain important features of dynamical behavior. For illustration, we compute the stable manifold of the origin spirall...
متن کاملStatistical cosymplectic manifolds and their submanifolds
In this paper, we introduce statistical cosymplectic manifolds and investigate some properties of their tensors. We define invariant and anti-invariant submanifolds and study invariant submanifolds with normal and tangent structure vector fields. We prove that an invariant submanifold of a statistical cosymplectic manifold with tangent structure vector field is a cosymplectic and minimal...
متن کاملGROUPOID ASSOCIATED TO A SMOOTH MANIFOLD
In this paper, we introduce the structure of a groupoid associated to a vector field on a smooth manifold. We show that in the case of the $1$-dimensional manifolds, our groupoid has a smooth structure such that makes it into a Lie groupoid. Using this approach, we associated to every vector field an equivalence relation on the Lie algebra of all vector fields on the smooth...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 15 شماره
صفحات -
تاریخ انتشار 2005