AN EFFICIENT METHOD FOR COMPUTING THE SIMPLEST NORMAL FORMS OF VECTOR FIELDS

Abstract

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 algebraic equations for computing the normal form and nonlinear transformation. Moreover, the new recursive method is not required for solving large matrix equations, instead it solves linear algebraic equations one by one. Thus the new method is computationally efficient. In addition, unlike the conventional normal form theory which uses separate nonlinear transformations at each order, this approach uses a consistent nonlinear transformation through all order computations. This enables one to obtain a convenient, one step transformation between the original system and the simplest normal form. The new method can treat general differential equations which are not necessarily assumed in a conventional normal form. The method is applied to consider Hopf and Bogdanov–Takens singularities, with examples to show the computation efficiency. Maple programs have been developed to provide an "automatic" procedure for applications.