Gravitational N-body simulations tools and algorithms
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 mut...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2009
|
| Ausgabe: | Digital repr. with corr. |
| Schriftenreihe: | Cambridge monographs on mathematical physics
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 |
|---|---|
| Beschreibung: | 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 |
| Beschreibung: | XV, 413 S. graph. Darst. |
| ISBN: | 9780521121538 9780521432726 |