Premium
Semi‐implicit reversible algorithms for rigid body rotational dynamics
Author(s) -
Nukala Phani Kumar V. V.,
Jr William Shelton
Publication year - 2006
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1874
Subject(s) - algorithm , mathematics , bounded function , rigid body , rigid body dynamics , mathematical analysis , physics , classical mechanics
This paper presents two semi‐implicit algorithms based on splitting methodology for rigid body rotational dynamics. The first algorithm is a variation of partitioned Runge–Kutta (PRK) methodology that can be formulated as a splitting method. The second algorithm is akin to a multiple time stepping scheme and is based on modified Crouch–Grossman (MCG) methodology, which can also be expressed as a splitting algorithm. These algorithms are second‐order accurate and time‐reversible; however, they are not Poisson integrators, i.e. non‐symplectic. These algorithms conserve some of the first integrals of motion, but some others are not conserved; however, the fluctuations in these invariants are bounded over exponentially long time intervals. These algorithms exhibit excellent long‐term behaviour because of their reversibility property and their (approximate) Poisson structure preserving property. The numerical results indicate that the proposed algorithms exhibit superior performance compared to some of the currently well known algorithms such as the Simo–Wong algorithm, Newmark algorithm, discrete Moser–Veselov algorithm, Lewis–Simo algorithm, and the LIEMID[EA] algorithm. Copyright © 2006 John Wiley & Sons, Ltd.