The symplecticity of multi-step methods (Q2365931): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3789492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian algorithms for Hamiltonian systems and a comparative numerical study / rank
 
Normal rank

Latest revision as of 18:04, 17 May 2024

scientific article
Language Label Description Also known as
English
The symplecticity of multi-step methods
scientific article

    Statements

    The symplecticity of multi-step methods (English)
    0 references
    29 June 1993
    0 references
    The paper deals with a Hamiltonian system \[ z'=J\nabla H(z),\;z\in \mathbb{R}^{2n},\;J=\bigl[{0 \atop I} {-I \atop 0}\bigr],\;H:\mathbb{R}^{2n}\to \mathbb{R}^ 1 \tag{1} \] is a Hamiltonian function. (1) is solved by means of the multistep method (2) \(\sum_{k=0}^ m \alpha_ k z_ k=\tau \sum_{k=0}^ m \beta_ k J\nabla H(z_ k)\). This method is symplectic if \(\bigl[ {{\partial g(z)} \over {\partial z}}\bigr]^ T J\bigl[ {{\partial g(z)} \over {\partial z}}\bigr]=J\) holds for all \(H\) and sufficiently small \(\tau\) where \(g:\mathbb{R}^ p\to \mathbb{R}^ p\) is the step-transition oprator satisfying \(\sum_{k=0}^ m \alpha_ k g^ k=\tau \sum_{k=0}^ m \beta_ k f\circ g^ k\) (\(g^ k\) is the \(k\)-time composition). It is proved that (2) of the order \(s\geq 1\) is non-symplectic for (1).
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian system
    0 references
    multistep method
    0 references
    symplectic
    0 references
    0 references