Higher Order Force Gradient Symplectic Algorithms
Siu A. Chin, Donald W. Kidwell
Abstract
We show that a recently discovered fourth order symplectic algorithm, which requires one evaluation of force gradient in addition to three evaluations of the force, when iterated to higher order, yielded algorithms that are far superior to similarly iterated higher order algorithms based on the standard Forest-Ruth algorithm. We gauge the accuracy of each algorithm by comparing the step-size independent error functions associated with energy conservation and the rotation of the Laplace-Runge-Lenz vector when solving a highly eccentric Kepler problem. For orders 6, 8, 10 and 12, the new algorithms are approximately a factor of 103, 104, 104 and 105 better.
Create a lesson
Related papers
Physical-state supervision for design-only Gaussian process surrogates of implosion simulations
Chang Liu, Hao Shen, Chuanying Li
Energy-dependent trapping of backscattered helium during magnetron sputtering growth: A molecular dynamics study
Pascal Brault, Anne-Lise Thomann, Alejandro Borroto
Alter-excitons in Altermagnets: Symmetry, Splitting and Dispersion
Yuanfan Xiong, Liangyu Wang, Xuan Wu et al.
All-electron RT-TDDFT with Exact Exchange based on Numeric Atom-centered Orbitals for Condensed Matter
Jianhang Xu, Christopher Shepard, Yosuke Kanai
Polyconvex neural-network surrogates with learned paired directional features for anisotropic hyperelastic homogenization
S. Ares de Parga, A. Cornejo, J. A. Hernández et al.
Parallel Design of a GPU-Resident Semi-Lagrangian Drift-Kinetic Solver on Unstructured Extruded Tokamak Meshes
Mark F. Adams