Philip W. Sharp
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Philip W. Sharp has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
J. H. Verner
3 shared publicationsJ.M. Fine
3 shared publications- Kevin Burrage
ARC Centre of Excellence for Plant Success in Nature and Agriculture, The University of Queensland, Brisbane, Queensland, 4072, Australia; QUT Centre for Data Science, Queensland University of Technology, Brisbane, Queensland, 4000, Australia; School of Mathematical Sciences, Queensland University of Technology, Brisbane, Queensland, 4000, Australia; Visiting Professor at Department of Computer Science, University of Oxford, Oxford, Oxfordshire, OX1 3QG, United Kingdom
2 shared publications - Kevin R. Grazier
The Jet Propulsion Laboratory, California Institute of Technology, Pasadena, USA
2 shared publications - Rémi Vaillancourt
University of Ottawa
2 shared publications - William I. Newman
University of California
2 shared publications
Latest Publications
- 5 February 2019
- Published by Springer Nature in Numerical Algorithms
- Vol. 81 (4) , 1459-1472
The performance of the N-body integrator SSS
- 5 February 2019
- Published by Springer Nature in Numerical Algorithms
- Vol. 81 (4) , 1459-1472
The performance of the N-body integrator SSS
- 1 September 2016
- Published by Elsevier in Journal of Computational Science
- Vol. 16, 89-97
GPU-enabled N-body simulations of the Solar System using a VOVS Adams integrator
- 1 September 2016
- Published by Elsevier in Journal of Computational Science
- Vol. 16, 89-97
GPU-enabled N-body simulations of the Solar System using a VOVS Adams integrator
- 18 February 2016
- Published by American Astronomical Society in The Astronomical Journal
- Vol. 151 (3)
A MULTIRATE VARIABLE-TIMESTEP ALGORITHM FOR N-BODY SOLAR SYSTEM SIMULATIONS WITH COLLISIONS
We present and analyze the performance of a new algorithm for performing accurate simulations of the solar system when collisions between massive bodies and test particles are permitted. The orbital motion of all bodies at all times is integrated using a high-order variable-timestep explicit Runge–Kutta Nyström (ERKN) method. The variation in the timestep ensures that the orbital motion of test particles on eccentric orbits or close to the Sun is calculated accurately. The test particles are divided into groups and each group is integrated using a different sequence of timesteps, giving a multirate algorithm. The ERKN method uses a high-order continuous approximation to the position and velocity when checking for collisions across a step. We give a summary of the extensive testing of our algorithm. In our largest simulation—that of the Sun, the planets Earth to Neptune and 100,000 test particles over 100 million years—the relative error in the energy after 100 million years was of the order of 10−11.
- 18 February 2016
- Published by American Astronomical Society in The Astronomical Journal
- Vol. 151 (3)
A MULTIRATE VARIABLE-TIMESTEP ALGORITHM FOR N-BODY SOLAR SYSTEM SIMULATIONS WITH COLLISIONS
We present and analyze the performance of a new algorithm for performing accurate simulations of the solar system when collisions between massive bodies and test particles are permitted. The orbital motion of all bodies at all times is integrated using a high-order variable-timestep explicit Runge–Kutta Nyström (ERKN) method. The variation in the timestep ensures that the orbital motion of test particles on eccentric orbits or close to the Sun is calculated accurately. The test particles are divided into groups and each group is integrated using a different sequence of timesteps, giving a multirate algorithm. The ERKN method uses a high-order continuous approximation to the position and velocity when checking for collisions across a step. We give a summary of the extensive testing of our algorithm. In our largest simulation—that of the Sun, the planets Earth to Neptune and 100,000 test particles over 100 million years—the relative error in the energy after 100 million years was of the order of 10−11.
- 16 October 2013
- Published by Springer Nature in Celestial Mechanics and Dynamical Astronomy
- Vol. 117 (4) , 423-434
Contractivity-preserving explicit Hermite–Obrechkoff ODE solver of order 13
- 16 October 2013
- Published by Springer Nature in Celestial Mechanics and Dynamical Astronomy
- Vol. 117 (4) , 423-434
Contractivity-preserving explicit Hermite–Obrechkoff ODE solver of order 13
- 14 March 2013
- Published by American Astronomical Society in The Astronomical Journal
- Vol. 145 (4)
A MULTIRATE STÖRMER ALGORITHM FOR CLOSE ENCOUNTERS
- 14 March 2013
- Published by American Astronomical Society in The Astronomical Journal
- Vol. 145 (4)
A MULTIRATE STÖRMER ALGORITHM FOR CLOSE ENCOUNTERS
- 5 April 2012
- Published by Springer Nature in Numerical Algorithms
- Vol. 62 (1) , 133-148
High order explicit Runge–Kutta Nyström pairs
- 5 April 2012
- Published by Springer Nature in Numerical Algorithms
- Vol. 62 (1) , 133-148
High order explicit Runge–Kutta Nyström pairs
- 1 December 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (9) , 2378-2386
The performance of phase-lag enhanced explicit Runge–Kutta Nyström pairs on -body problems- 1 December 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (9) , 2378-2386
The performance of phase-lag enhanced explicit Runge–Kutta Nyström pairs on -body problems- 15 December 2008
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 222 (2) , 608-621
Hermite–Birkhoff–Obrechkoff four-stage four-step ODE solver of order 14 with quantized step size
- 15 December 2008
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 222 (2) , 608-621
Hermite–Birkhoff–Obrechkoff four-stage four-step ODE solver of order 14 with quantized step size
- Open Access
- 1 September 2006
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 32 (3) , 375-395
N-body simulations
We describe four challenging N-body test problems involving the Sun and planets and use them to compare the performance of nine nonsymplectic and two symplectic integrators. Each problem has a long interval of integration and two have non-Newtonian gravitational interactions. The emphasis in our comparison is on the accuracy of the solution, including the phase information produced by nonsympletic methods; the symplectic methods have been included to provide a contrast. Long intervals of integration necessitate small local error tolerances for the nonsymplectic integrators.Among variable-stepsize integrators, RKNINT requires the least CPU time on the two problems with Newtonian interactions and DIVA the least CPU time on the other two problems for the intervals of integration we used. We find that the error growth on some integrations is noticeably slower than predicted by asymptotic analysis of the truncation and round-off error. Our comparisons suggest that the numerical solutions near the end of a billion year simulation in double precision with variable-stepsize nonsymplectic methods would have poor accuracy.
- 1 September 2006
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 32 (3) , 375-395
Open AccessN-body simulations
We describe four challenging N-body test problems involving the Sun and planets and use them to compare the performance of nine nonsymplectic and two symplectic integrators. Each problem has a long interval of integration and two have non-Newtonian gravitational interactions. The emphasis in our comparison is on the accuracy of the solution, including the phase information produced by nonsympletic methods; the symplectic methods have been included to provide a contrast. Long intervals of integration necessitate small local error tolerances for the nonsymplectic integrators.Among variable-stepsize integrators, RKNINT requires the least CPU time on the two problems with Newtonian interactions and DIVA the least CPU time on the other two problems for the intervals of integration we used. We find that the error growth on some integrations is noticeably slower than predicted by asymptotic analysis of the truncation and round-off error. Our comparisons suggest that the numerical solutions near the end of a billion year simulation in double precision with variable-stepsize nonsymplectic methods would have poor accuracy.