کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10350063 863767 2005 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A REDUCE program for the normalization of polynomial Hamiltonians
موضوعات مرتبط
مهندسی و علوم پایه شیمی شیمی تئوریک و عملی
پیش نمایش صفحه اول مقاله
A REDUCE program for the normalization of polynomial Hamiltonians
چکیده انگلیسی
Distribution format:tar.gz Nature of physical problem. The transformation bringing a given Hamiltonian function into the normal form (namely, the normalization) is one of the conventional methods for non-linear Hamiltonian systems [A.J. Lichtenberg, M.A. Lieberman, Regular and Stochastic Motion, Springer-Verlag, Berlin, 1983; G.D. Birkhoff, Dynamical Systems, A.M.S. Colloquium Publications, New York, 1927; F. Gustavson, Astron. J. 71 (1966) 670; G.I. Hori, Astron. Soc. Japan 18 (1966) 287; A. Deprit, Cel. Mech. 1 (1969) 12; A.A. Kamel, Cel. Mech. 3 (1970) 90]. 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 [L.E. Reichl, The Transition to Chaos. Conservative Classical Systems: Quantum Manifestations, Springer, New York, 1992]. 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. Method of solution. The canonical transformation proceeding the normalization is expressed in terms of the Lie transformation power series, which is also referred to as the Hori-Deprit 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 degree-3 to the degree desired to be normalized. The generating function thus obtained is applied to the calculation of (formal) integrals of motion. Restrictions due to the complexity of the problem. The computation time rises 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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Physics Communications - Volume 166, Issue 1, 15 February 2005, Pages 66-80
نویسندگان
, , , , , ,