Freshly Printed - allow 6 days lead
Gravitational N-Body Simulations
Tools and Algorithms
Unique coverage of numerical simulation of gravitational systems, including the mathematics for computational methods of the classical N-body problem.
Sverre J. Aarseth (Author)
9780521121538, Cambridge University Press
Paperback, published 15 October 2009
430 pages
24.4 x 17 x 2.2 cm, 0.69 kg
Review of the hardback: 'Gravitational N-Body Simulations is a masterful summary of computational techniques … written by Sverre Aarseth, a pioneer in the field … Aarseth's long-awaited book is a comprehensive historical survey of the field of N-body experimentation, as well as a 'user's manual' for his NBODY series of codes. … it is a pleasure to see [the material] presented here in such a complete and coherent fashion. … This book should be almost indispensable to N-body practitioners, especially (but not exclusively) those who use one of Aarseth's NBODY codes.' General Relativity and Gravitation
This book discusses in detail all the relevant numerical methods for the classical N-body problem. It demonstrates how to develop clear and elegant algorithms for models of gravitational systems, 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 astrophysical phenomena such as close encounters and the dynamics of black hole binaries. The author reviews relevant work in the field and covers applications to the problems of planetary formation and star cluster dynamics, both of Pleiades type and globular clusters. Self-contained and pedagogical, this book is suitable for graduate students and researchers in theoretical physics, astronomy and cosmology.
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.