Gravitational N-Body Simulations
Gravitational N-Body Simulations
This self-contained book presents basic methods of numerical simulation of gravitational systems, with applications in astronomy and cosmology. The first half of the book presents and explains the fundamental mathematical tools needed to describe the dynamics of a large number of mutually attractive particles. Particular attention is given to the techniques needed to model known planetary and astrophysical phenomena such as Hubble motion. The second half of the book demonstrates how to develop clear and elegant algorithms for models of gravitational systems.
- Unique coverage of the subject, including the mathematics for computational methods of the classical N-body problem
- Algorithms for a wide range of problems in dynamical astronomy and cosmology
- Review of direct N-body simulations with comprehensive bibliography
Reviews & endorsements
"Within the N-body community the name of Sverre Aarseth is legendary. His pioneering approach to numerical simulation proved to be decades ahead of its time, as was his insistence on making his latest source code publicly available...as a list of what you need to think about to perform direct N-body simulations well, this book is excellent."
Contemporary Physics
"... A distinctive presentation of the material for a book that is intended for graduate students (among others)."
Phillip W. Sharp, Mathematical Reviews
Product details
October 2009Paperback
9780521121538
430 pages
244 × 170 × 22 mm
0.69kg
Available
Table of Contents
- Preface
- 1. The N-body problem
- 2. Predictor-corrector methods
- 3. Neighbour treatments
- 4. Two-body regularization
- 5. Multiple regularization
- 6. Tree codes
- 7. Program organization
- 8. Initial setup
- 9. Decision-making
- 10. Neighbour schemes
- 11. Two-body algorithms
- 12. Chain procedures
- 13. Accuracy and performance
- 14. Practical aspects
- 15. Star clusters
- 16. Galaxies
- 17. Planetary systems
- 18. Small-N experiments
- Appendix A. Global regularization algorithms
- Appendix B. Chain algorithms
- Appendix C. High-order systems
- Appendix D. Practical algorithms
- Appendix E. KS procedures with GRAPE
- Appendix F. Alternative simulation method
- Appendix G. Table of symbols
- Appendix H. Hermite integration method
- References
- Index.
