
PROGRAM LIBRARY JINRLIBLINA01  a REDUCE program for the normalization of polynomial hamiltoniansAuthors: Yu.A.Ukolov, N.A.Chekanov, A.A.Gusev, V.A.Rostovtsev, S.I.Vinitsky, Y.Uwano 

Language: Reduce vs.3.7. Nature of problem: The transformation bringing a given Hamiltonian function into the normal form namely, the normalization) is one of the conventional methods for nonlinear Hamiltonian systems [16]. Recently, beyond classical mechanics, the normal form method has been applied to quantization of chaotic Hamiltonian systems with the aim of finding quantum signature of chaos [7]. Besides those utilities, the normalization requires quite cumbersome algebraic calculations of polynomials, so that the computer algebraic approach is worth studying to promote further investigations around the normalization together with the ones around the inverse normalization. Solution method: The canonical transformation proceeding the normalization is expressed in terms of the Lie transformation power series, which is also referred to as the HoriDeprit transformation. After (formal) power series expansion as above, the fundamental equation of the normalization is solved for the normal form together with the generating function of transformation recursively from degree3 to the degree desired to be normalized. The generating function thus obtained is applied to the calculation of (formal) integrals of motion. Restrictions: The computation time raises in a combinatorial manner as the desired degree of normalization does. Especially, such a combinatorial growth of computation is more significant in the inverse normalization than in the direct one. The hardware (processor and memory, for example) available for the computation may restrict either the degree of normalization or the computation time. See also: http://cpc.cs.qub.ac.uk/summaries/ADUV_v1_0.html References:
