A Comparison of Algorithms for the Normalization and Quantization of Polynomial Hamiltonians

  • Authors:

  • A. A. Gusev;N. A. Chekanov;V. A. Rostovtsev;S. I. Vinitsky;Y. Uwano

  • Affiliations:

  • Joint Institute for Nuclear Research, Dubna, Moscow oblast, 141980 Russia;Belgorod State University, Belgorod, Russia;Joint Institute for Nuclear Research, Dubna, Moscow oblast, 141980 Russia;Joint Institute for Nuclear Research, Dubna, Moscow oblast, 141980 Russia vinitsky@thsun1.jinr.ru;University of Kyoto, Kyoto, Japan

  • Venue:
  • Programming and Computing Software
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Algorithms and programs for the normalization of polynomial Hamiltonians of classical mechanics by the Birkhoff–Gustavson and Deprit–Hori, as well as quasi-classical quantization procedures for normal forms, are compared. The algorithms and programs are represented in a universal pseudocode and implemented in the computer algebra systems REDUCE, MAPLE, and MATHEMATICA. Examples that illustrate the operation of these algorithms and programs for polynomial Hamiltonians of atomic systems in external electromagnetic fields are considered.