An explicit recursive formula for computing the normal forms associated with semisimple cases
نویسندگان
چکیده
This paper presents an explicit, computationally efficient, recursive formula for computing the normal forms, center manifolds and nonlinear transformations for general n-dimensional systems, associated with semisimple singularities. Based on the formula, we develop a Maple program, which is very convenient for an end-user who only needs to prepare an input file and then execute the program to ‘‘automatically’’ generate the result. Several examples are presented to demonstrate the computational efficiency of the algorithm. 2013 Elsevier B.V. All rights reserved.
منابع مشابه
An Efficient Method for Computing the Simplest Normal Forms of Vector Fields
A computationally efficient method is proposed for computing the simplest normal forms of vector fields. A simple, explicit recursive formula is obtained for general differential equations. The most important feature of the approach is to obtain the “simplest” formula which reduces the computation demand to minimum. At each order of the normal form computation, the formula generates a set of al...
متن کاملComputation of the Normal Form for 1:1 Resonant Double Hopf Bifurcation
An efficient method is presented for computing the normal form of general n-dimensional systems associated with 1:1 resonant double Hopf bifurcation. The approach combines the computations of center manifold and normal form in one unified procedure. The Jacobian of the system evaluated at an equilibrium contains non-semisimple eigenvalues. Explicit formulas are obtained for directly computing t...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملComputation of Simplest Normal Forms of differential equations associated with a Double-Zero Eigenvalue
In this paper a method is presented for computing the simplest normal form of differential equations associated with the singularity of a double zero eigenvalue. Based on a conventional normal form of the system, explicit formulae for both generic and nongeneric cases are derived, which can be used to compute the coefficients of the simplest normal form and the associated nonlinear transformati...
متن کاملEquivalence of the MTS Method and CMR Method for Differential Equations Associated with Semisimple Singularity
In this paper, the equivalence of the multiple time scales (MTS) method and the center manifold reduction (CMR) method is proved for computing the normal forms of ordinary differential equations and delay differential equations. The delay equations considered include general delay differential equations (DDE), neutral functional differential equations (NFDE) (or neutral delay differential equat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014