On Order Conditions for Partitioned Symplectic Methods (Q4377552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1116305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Order Conditions for Partitioned Symplectic Methods |
scientific article; zbMATH DE number 1116305 |
Statements
On Order Conditions for Partitioned Symplectic Methods (English)
0 references
10 February 1998
0 references
Hamiltonian systems
0 references
symplectic methods
0 references
order conditions
0 references
partitioned Runge-Kutta methods
0 references
P-series
0 references
\(H\)-trees
0 references
0.91996825
0 references
0.91135335
0 references
0.90786374
0 references
0.89663154
0 references
0.89550775
0 references
0.89548576
0 references
0.88599575
0 references
The subject of the paper consists in symplectic methods for integrating Hamiltonian systems that may be expanded as P-series, i. e., partitioned methods. In comparison with the general case, it is known, the order conditions for symplectic methods are simplified. The author shows that there is a one-to-one correspondence between the set of independent order conditions for symplectic methods and a suitable set of oriented graphs that one calls \(H\)-trees. The number of such \(H\)-trees, i.e., the number of independent order conditions is counted.
0 references
