Comparing Planetary Accretion in Two and Three Dimensions
โ Scribed by J.E. Chambers
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 366 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0019-1035
No coin nor oath required. For personal study only.
โฆ Synopsis
Two ways to speed up N-body simulations of planet formation are (i) to confine motion to 2 spatial dimensions, or (ii) to artificially enhance the physical radii of the bodies. These short cuts have the same effect of increasing the collision probability between objects. Here, I compare the results of four integrations using these approximations with two more realistic simulations. Each integration begins with 153 lunar-mass planetary embryos with semi-major axes 0.3 < a < 2.0 AU, plus Jupiter and Saturn. The two-and three-dimensional (2D and 3D) simulations have many differences. In 3D, orbital eccentricities become larger than in 2D, there is more radial mixing of material, and a significant amount of mass falls into the Sun. In 3D, objects remain on crossing orbits until accretion is complete, while in 2D, embryos become isolated from each other when โผ10 bodies still remain. The ฮฝ 5 and ฮฝ 6 secular resonances affect evolution in the inner and outer parts of the terrestrial-planet region in 3D, but are unimportant in 2D. The 2D integrations yield more final planets, with smaller eccentricities, than the 3D case. Stochasticity plays a minor role in 2D, while chance events dominate the outcome in 3D. Generally, the simulations with enhanced radii yield results intermediate between the 2D and the 3D cases, having more in common with the former. The differences between the 2D and the 3D integrations occur principally because in 3D, the collision timescale is large compared to the timescale for orbital evolution, while in 2D, these timescales are comparable.
๐ SIMILAR VOLUMES
This paper concerns the problem of pose estimation, in particular the application of linear and nonlinear methods to the case of anisotropic error distributions. Incremental and batch techniques are discussed, and a linear solution to the two dimensional problem is developed by reference to the nois
We discuss the weighted minimum number polygonal approximation problem. Eu and Toussaint (1994, CVGIP: Graphical Models Image Process. 56, 231-246) considered this problem subject to the parallel-strip error criterion in R 2 with L q distance metrics, and they concluded that it can be solved in O(n