Normal form algorithm

In summary, the "output" of the normal form algorithm is the following ... 

This shows, e.g., that the flux scales with E for energies close to the saddle energy. The key advantage of the normal form coordinates resulting from the normal form algorithm is that it allows one to include the nonlinear corrections to (22) to any desired order. 

The algorithm used in the normal form transformation is not discussed here in detail. It is described in Refs. 34 and 35. A time-dependent generalization of this normal form procedure is presented in Section IVB. 

After completing the first phase we have a feasible basic solution. The second phase is nothing else but the simplex method applied to the normal form. The following module strictly follows the algorithmic steps described. 

The phase space structures near equilibria of this type exist independently of a specific coordinate system. However, in order to carry out specific calculations we will need to be able to express these phase space structures in coordinates. This is where Poincare-Birkhoff normal form theory is used. This is a well-known theory and has been the subject of many review papers and books, see, e.g.. Refs. [34-AOj. For our purposes it provides an algorithm whereby the phase space structures described in the previous section can be realized for a particular system by means of the normal form transformation which involves making a nonlinear symplectic change of variables. 

The normal form transformation T in (7) can be computed in an algorithmic fashion. One can give an explicit expression for the phase space structures discussed in the previous section in terms of the normal form coordinates, (q, p). This way the phase space structures can be constructed in terms of the normal form coordinates, q, p), and for physical interpretation transformed back to the original "physical" coordinates, q, p), by the inverse of the transformation T. ... 

In such a non-incremental synthesis, the series of expanded logic algorithms can be shown to progress upwards (see below). To achieve this expansion, we here only consider logic algorithms whose bodies are in disjunctive normal form. The used predicates are assumed to be either primitives or the predicate rhi that is defined by the logic algorithm. Let s start with a few basic definitions. 

In this section, we will discuss some algorithms for constructing normal forms. Due to the reduction principle, it is sufficient to construct the normal forms for the system on the center manifold only. Therefore, in order to consider bifurcations of an equilibrium state with a single zero characteristic root, we need a one-dimensional normal form. If it has a pair of zero characteristic exponents, one should examine the corresponding family of two-dimensional normal forms, and so on. 

An analogous algorithm can be applied to the multi-dimensional case. The limit of the rescaled system as governing parameters tend to zero gives a description in the main order of the behavior of the system near a bifurcation point. Such a limit system is called an asymptotic normal form. 

Energy minimisation and normal mode analysis have an important role to play in the study of the solid state. Algorithms similar to those discussed above are employed but an extra feature of such systems, at least when they form a perfect lattice, is that it is can be possible to exploit the space group symmetry of the lattice to speed up the calculations. It is also important to properly take the interactions with atoms in neighbouring cells into account. 

Several features make this algorithm particularly attractive for the optimization of a formulation response. The algorithm requires only the input of the lower and upper limits of the individual components and the equation describing the response. Both of these must be expressed in either normal or pseudocomponent form. A randomization procedure generates the initial simplex within the individual component constraints by ... 

---