Automatic code generator for higher order integrators
Computer Physics Communications, ISSN: 0010-4655
2014
- 250Usage
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage250
- Views234
- Downloads16
Dataset Description
Abstract Some explicit algorithms for higher order symplectic integration of a large class of Hamilton’s equations have recently been discussed by Mushtaq et al. Here we present a Python program for automatic numerical implementation of these algorithms for a given Hamiltonian, both for double precision and multiprecision computations. We provide examples of how to use this program, and illustrate behavior of both the code generator and the generated solver module(s). Title of program: HOMsPy Catalogue Id: AESD_v1_0 Nature of problem We have developed algorithms [5] for numerical solution of Hamilton's equations. qdot a = ΔH(q,p)/Δp a , pdot a = -ΔH(q,p)/Δq a , a=1.....,N (1) for Hamiltonians of the form H(q,p)= T(p) + V(q) = 1/2p T M p +V(q), (2) with M a symmetric positive definite matrix. The algorithms preserve the symplectic property of the time evolution exactly, and are of orders Τ N (for 2 ≤N ≤ 8) in the timestep Τ. Although explicit, the algorithms are time-cons...
Bibliographic Details
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know