Volume-preserving algorithms for source-free dynamical systems (Q1907119)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Volume-preserving algorithms for source-free dynamical systems |
scientific article; zbMATH DE number 839143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Volume-preserving algorithms for source-free dynamical systems |
scientific article; zbMATH DE number 839143 |
Statements
Volume-preserving algorithms for source-free dynamical systems (English)
0 references
16 June 1996
0 references
A source-free dynamical system is defined by the differential equation \(\dot x= a(x)\) with \(\text{div}(a)= 0\). To solve this system numerically for \(x\), it is quite recommended to use volume-preserving algorithms; the aim of the paper is to construct difference schemes preserving this structure. One first shows that the conventional methods, including Runge-Kutta methods and Euler methods are non-volume preserving, and then one defines the ``essentially Hamiltonian decomposition'' of source-free vector fields. This decomposition is then used to construct a volume-preserving difference scheme.
0 references
essentially Hamiltonian decomposition
0 references
source-free dynamical system
0 references
volume-preserving algorithms
0 references
difference schemes
0 references
Runge-Kutta methods
0 references
Euler methods
0 references