Gravitational N-Body Simulations

Tools and Algorithms

AvSverre J. Aarseth

Häftad, Engelska, 2009

Del i serien Cambridge Monographs on Mathematical Physics

908 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

2 239 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2009-10-15
Mått:170 x 244 x 22 mm
Vikt:690 g
Format:Häftad
Språk:Engelska
Serie:Cambridge Monographs on Mathematical Physics
Antal sidor:430
Förlag:Cambridge University Press
ISBN:9780521121538

Utforska kategorier

Recensioner i media

Review of the hardback: 'Sverre's dogma of numerical accuracy combined with detailed testing and a deep understanding of the basic algorithmic form runs throughout this book. … as a list of what you need to think about to perform direct N-Body simulations well, this book is excellent.' Contemporary Physics

Innehållsförteckning

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.