Computer normalization of Hamiltonian systems in analytic form

A. G. Sokol'skii, I. I. Shevchenko

Результат исследований: Научные публикации в периодических изданияхстатья

Выдержка

Various algorithms for normalizing autonomous Hamiltonian systems are considered: for expanding a Hamiltonian in a Taylor series, and for linear and non-linear normalization. The number of degrees of freedom of the Hamiltonian system and order of normalization are arbitrary. It is assumed that all the eigenvalues of the matrix of the linearized system are purely imaginary and there are no resonances up to second order inclusive, that is, there are no equal or zero frequencies in the system. The most economical algorithms for use in analytic computation systems as regards computer memory are described and implemented in a software package written in the REDUCE language. This software can be used for all the analytical calculations arising from computer normalization of autonomous Hamiltonian systems.

Язык оригиналаанглийский
Страницы (с-по)1059-1065
Число страниц7
ЖурналComputational Mathematics and Mathematical Physics
Том33
Номер выпуска8
СостояниеОпубликовано - 1 дек 1993

Отпечаток

Hamiltonians
Hamiltonian Systems
Normalization
Autonomous Systems
Taylor series
Software Package
Degree of freedom
Software packages
Eigenvalue
Computer systems
Software
Zero
Arbitrary
Data storage equipment
Form

Предметные области Scopus

  • Вычислительная математика

Цитировать

@article{53e791d87dc74f35832ea39e235859d4,
title = "Computer normalization of Hamiltonian systems in analytic form",
abstract = "Various algorithms for normalizing autonomous Hamiltonian systems are considered: for expanding a Hamiltonian in a Taylor series, and for linear and non-linear normalization. The number of degrees of freedom of the Hamiltonian system and order of normalization are arbitrary. It is assumed that all the eigenvalues of the matrix of the linearized system are purely imaginary and there are no resonances up to second order inclusive, that is, there are no equal or zero frequencies in the system. The most economical algorithms for use in analytic computation systems as regards computer memory are described and implemented in a software package written in the REDUCE language. This software can be used for all the analytical calculations arising from computer normalization of autonomous Hamiltonian systems.",
author = "Sokol'skii, {A. G.} and Shevchenko, {I. I.}",
year = "1993",
month = "12",
day = "1",
language = "English",
volume = "33",
pages = "1059--1065",
journal = "Computational Mathematics and Mathematical Physics",
issn = "0965-5425",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "8",

}

Computer normalization of Hamiltonian systems in analytic form. / Sokol'skii, A. G.; Shevchenko, I. I.

В: Computational Mathematics and Mathematical Physics, Том 33, № 8, 01.12.1993, стр. 1059-1065.

Результат исследований: Научные публикации в периодических изданияхстатья

TY - JOUR

T1 - Computer normalization of Hamiltonian systems in analytic form

AU - Sokol'skii, A. G.

AU - Shevchenko, I. I.

PY - 1993/12/1

Y1 - 1993/12/1

N2 - Various algorithms for normalizing autonomous Hamiltonian systems are considered: for expanding a Hamiltonian in a Taylor series, and for linear and non-linear normalization. The number of degrees of freedom of the Hamiltonian system and order of normalization are arbitrary. It is assumed that all the eigenvalues of the matrix of the linearized system are purely imaginary and there are no resonances up to second order inclusive, that is, there are no equal or zero frequencies in the system. The most economical algorithms for use in analytic computation systems as regards computer memory are described and implemented in a software package written in the REDUCE language. This software can be used for all the analytical calculations arising from computer normalization of autonomous Hamiltonian systems.

AB - Various algorithms for normalizing autonomous Hamiltonian systems are considered: for expanding a Hamiltonian in a Taylor series, and for linear and non-linear normalization. The number of degrees of freedom of the Hamiltonian system and order of normalization are arbitrary. It is assumed that all the eigenvalues of the matrix of the linearized system are purely imaginary and there are no resonances up to second order inclusive, that is, there are no equal or zero frequencies in the system. The most economical algorithms for use in analytic computation systems as regards computer memory are described and implemented in a software package written in the REDUCE language. This software can be used for all the analytical calculations arising from computer normalization of autonomous Hamiltonian systems.

UR - http://www.scopus.com/inward/record.url?scp=44949266828&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:44949266828

VL - 33

SP - 1059

EP - 1065

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 8

ER -