Computation of the simplest normal forms with perturbation parameters based on Lie transform and rescaling (Q1612380)

From MaRDI portal
Revision as of 03:34, 10 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Computation of the simplest normal forms with perturbation parameters based on Lie transform and rescaling
scientific article

    Statements

    Computation of the simplest normal forms with perturbation parameters based on Lie transform and rescaling (English)
    0 references
    22 August 2002
    0 references
    A nonlinear ordinary differential equation \[ {dx\over dt}=f(x,\mu),\quad x\in {\mathbb{R}^n},\quad \mu\in{\mathbb{R}^m}, \] analytic with respect to \(x\) and a parameter \(\mu\), with the equilibrium point \((0,\mu)\) is considered. The aim of this work is to find a possibly simple form of any term homogeneous with respect to \(x\) and \(\mu\) of the Taylor expansion of \(f(x,\mu)\) at the equilibrium point. Such a procedure may be very useful in studying the singularities such as bifurcation, instability and so on of the equation discussed . Here the important tool is the Lie transformation of any homogeneous \(k\)-degree polynomial \(U_k\) \[ U_k\mapsto[U_k,v]=DvU_k-DU_kv, \] where \(v\) is of degree 1. The author develops basic ideas involved in the procedure of finding the so called conventional normal form. The number of variables in the system of linear algebraic equations of the above mentioned procedure is greater than the number of equations. Instead of setting to zero the variables which cannot be determined from the system, the author retains all the variables. It gives him the possibility to use them in the process of further reduction. Such a procedure leads to the new `form' of the normal form, the so called simplest normal form (SNF). Theorem 1 gives formulae connecting any homogeneous term of the SNF with corresponding terms of the nonlinear transformation. The formulae contain time rescaling factors, and are suitable for recursive computation, for example, with use of a kind of computer algebra system as Maple. The case of single zero singularity is discussed more in details.
    0 references
    simplest normal forms
    0 references
    nonlinear ordinary differential equation
    0 references
    bifurcation
    0 references
    instability
    0 references
    Lie transformation
    0 references
    conventional normal form
    0 references
    simplest normal form
    0 references
    computer algebra system
    0 references
    single zero singularity
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references