๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for normalization of Hamiltonian systems by means of computer algebra

โœ Scribed by Ivan I. Shevchenko; Andrej G. Sokolsky

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
757 KB
Volume
77
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computing normal forms of nonseparable H
Computing normal forms of nonseparable Hamiltonians by symbolic manipulation
โœ P.E. Raines; T. Uzer ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

Finding normal forms of nonintegrable Hamiltonians is a problem encountered in many branches of physics. In this article, a symbolic program is presented which uses a succession of canonical transformations to construct the Birkhoff-Gustavson normal form of a nonseparable Hamiltonian.

High speed dirac algebra calculations in
High speed dirac algebra calculations in a space of arbitrary dimension by means of a computer algebra system
โœ V.A. Ilyin; A.P. Kryukov; A.Ya. Rodioniov; A.Yu. Taranov ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

The paper deals with the problem of quick Dirac's y-matnx trace computation in spaces of arbitrary dimension. The realization of the Kennedy-Cvitanovic (KC) algorithm in the REDUCE computer algebra system is discussed. It is shown that the KC algorithm has remarkably better runtimes than the standar

From algebraic sets to monomial linear b
From algebraic sets to monomial linear bases by means of combinatorial algorithms
โœ L. Cerlienco; M. Mureddu ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 627 KB

Let K be a field; let ~mK" be a finite set and let 3(N)mK[xl ..... x,] be the ideal of ~. A purely combinatorial algorithm to obtain a linear basis of the quotient algebra K Ix1 ..... x,]/3(~) is given. Such a basis is represented by an n-dimensional Ferrers diagram of monomials which is minimal wit