𝔖 Bobbio Scriptorium
✦   LIBER   ✦

COMPUTATION OF NORMAL FORMS VIA A PERTURBATION TECHNIQUE

✍ Scribed by P. Yu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
274 KB
Volume
211
Category
Article
ISSN
0022-460X

No coin nor oath required. For personal study only.

✦ Synopsis

Considering qualitative behavior of a non-linear dynamical system often leads to first simplifying the differential equations or finding their normal forms. A perturbation technique for computing normal forms is presented. This technique, associated with the method of multiple scales, can be used to systematically find a unique form for a given set of differential equations. The technique is discussed in detail through the analysis of Hopf bifurcation. It is shown that for Hopf bifurcation, the method only requires solving two dimensional matrix systems for any higher order normal forms of a general n-dimensional system. With the aid of the symbolic language Maple, this approach is straightforward, and is computationally efficient and fast. Furthermore, a simple verification scheme is given for verifying the normal forms and associated non-linear transformations obtained using any methodology. Examples are presented to demonstrate the applicability of the perturbation technique and the computation efficiency of the Maple program.

πŸ“œ SIMILAR VOLUMES

SYMBOLIC COMPUTATION OF NORMAL FORMS FOR
SYMBOLIC COMPUTATION OF NORMAL FORMS FOR RESONANT DOUBLE HOPF BIFURCATIONS USING A PERTURBATION TECHNIQUE
✍ P. YU πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 312 KB

This paper presents a perturbation method for computing the normal forms of resonant double Hopf bifurcations with the aid of a computer algebraic system. This technique, based on the method of multiple time scales, can be used to deal with general n-dimensional systems without the application of ce

A RECURSIVE APPROACH TO COMPUTE NORMAL F
A RECURSIVE APPROACH TO COMPUTE NORMAL FORMS
✍ L. HSU; L.J. MIN; L. FAVRETTO πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 388 KB

Normal forms are instrumental in the analysis of dynamical systems described by ordinary di!erential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses o

ON THE COMPUTATION OF THE COEFFICIENTS A
ON THE COMPUTATION OF THE COEFFICIENTS ASSOCIATED WITH HIGH ORDER NORMAL FORMS
✍ WEIYI ZHANG; KONCAY HUSEYIN; MIN YE πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 168 KB

A new procedure for obtaining high order normal forms and the associated coe$cients is presented. It is assumed that the Jacobian of the system considered is in a diagonal form. In comparison with existing normal form approaches, this procedure lends itself more readily to symbolic calculations, lik

An Algorithm for Computing a New Normal
An Algorithm for Computing a New Normal Form for Dynamical Systems
✍ Guoting Chen; Jean Della Dora πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 378 KB

We propose in this paper a new normal form for dynamical systems or vector fields which improves the classical normal forms in the sense that it is a further reduction of the classical normal forms. We give an algorithm for an effective computation of these normal forms. Our approach is rational in

Computing the Rational Torsion of an Ell
Computing the Rational Torsion of an Elliptic Curve Using Tate Normal Form
✍ Irene Garcı́a-Selfa; Miguel A. Olalla; JosΓ© M. Tornero πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 137 KB

It is a classical result (apparently due to Tate) that all elliptic curves with a torsion point of order n ð44n410; or n ¼ 12Þ lie in a one-parameter family. However, this fact does not appear to have been used ever for computing the torsion of an elliptic curve. We present here an extremely down-to