Abstract
The algorithm for Hamiltonian transformation in the quadratic perturbation technique of one of the authors admits of various equivalent forms. Using as a criterion the number of inter-term multiplications required for transformation, however, the amount of effort required to obtain the transformed Hamiltonian is not equivalent among these forms. Each is considered in some detail, and general guidelines for the choice of ‘most efficient’ algorithm to be used in a given problem are provided. Their utility is demonstrated by application to Duffing's equation.
Similar content being viewed by others
References
Arnol'd, V. I.: 1963,Russ. Math. Surv. 18, 85.
Goldstein, H.: 1950,Classical Mechanics, Addison-Wesley.
Howland, R. A.: 1977,Celest. Mech. 15, 327.
Howland, R. A.: 1979,Celest. Mech. 19, 95.
Howland, R. A. and Richardson, D. L.: to appear inJ. Comp. Phys.
Howland, R. A. and Richardson, D. L.: 1983, in W. F. Ames and Vichnevetsky (eds.),Modeling and Simulation in Engineering, (Vol. 3 ofIMACS Transactions on Scientific Computing), North-Holland, Amsterdam, the Netherlands, p. 279.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Howland, R.A., Richardson, D.L. The Hamiltonian transformation in quadratic lie transforms. Celestial Mechanics 32, 99–107 (1984). https://doi.org/10.1007/BF01231118
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01231118