High-Order Symplectic Partitioned Lie Group Methods
نویسندگان
چکیده
منابع مشابه
Order conditions for commutator-free Lie group methods
We derive order conditions for commutator-free Lie group integrators. These schemes can for certain problems be good alternatives to the Runge-Kutta-Munthe-Kaas schemes, especially when applied to stiff problems or to homogeneous manifolds with large isotropy groups. The order conditions correspond to a certain subsets of the set of ordered rooted trees. We discuss ways to select these subsets ...
متن کاملOn Higher-order Semi-explicit Symplectic Partitioned Runge-kutta Methods for Constrained Hamiltonian Systems
In this paper we generalize the class of explicit partitioned Runge-Kutta (PRK) methods for separable Hamiltonian systems to systems with holonomic constraints. For a convenient analysis of such schemes, we rst generalize the backward error analysis for systems in I R m to systems on manifolds embedded in I R m. By applying this analysis to constrained PRK methods, we prove that such methods wi...
متن کاملOn Contact and Symplectic Lie Algeroids
In this paper, we will study compatible triples on Lie algebroids. Using a suitable decomposition for a Lie algebroid, we construct an integrable generalized distribution on the base manifold. As a result, the symplectic form on the Lie algebroid induces a symplectic form on each integral submanifold of the distribution. The induced Poisson structure on the base manifold can be represented by m...
متن کاملLie Group Methods *
Definition 1.1. [Ol] An m-dimensional manifold M is a topological space covered by a collection of open subsets Wα ⊂M (coordinate charts) and maps Xα : Wα → Vα ⊂ R one-to-one and onto, where Vα is an open, connected subset of R. (Wα,Xα) define coordinates on M. M is a smooth manifold if the maps Xαβ = Xβ ◦X−1 α , are smooth where they are defined, i.e. on Xα(Wα ∩Wβ) to Xβ(Wα ∩Wβ). Example 1.2. ...
متن کاملStability of Explicit Symplectic Partitioned Runge-Kutta Methods
A numerical method for solving Hamiltonian equations is said to be symplectic if it preserves the symplectic structure associated with the equations. Various symplectic methods are widely used in many fields of science and technology. A symplectic method preserves an approximate Hamiltonian perturbed from the original Hamiltonian. It theoretically supports the effectiveness of symplectic method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2015
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-015-9257-9