|
1 Introduction
|
|
|
2 Choice of a simulation method
|
|
|
3 General considerations
|
|
|
4 Relaxation
|
|
|
5 Orbital displacements and potential updating
|
|
|
6 Other ingredients
|
|
|
7 Code testing
|
|
|
8 Conclusions
|
|
|
Appendix A: Practical computation of a super-encounter
|
|
|
Appendix B: Random selection of a new orbital radius
|
|
|
Appendix C: Binary tree structure and algorithms
|
|
|
Appendix D: Tests for spurious relaxation
|
|
|
References
|
