Formation of Massive Counterrotating Disks in Spiral Galaxies
Auteurs : Aniruddha R. Thakar (Ohio State University), Barbara S. Ryden (Ohio State University)
Résumé : We present results of numerical simulations of the formation of a massive counterrotating gas disk in a spiral galaxy. Using a hierarchical tree gravity solver combined with a sticky-particle gas dissipation scheme for our simulations, we have investigated three mechanisms: episodic and continuous gas infall, and a merger with a gas-rich dwarf galaxy. We find that both episodic and continuous gas infall work reasonably well and are able to produce a substantial gas counterrotating disk without upsetting the stability of the existing disk drastically, but it is very important for the gas to be well-dispersed in phase-space and not form concentrated clumps prior to its absorption by the disk galaxy. The initial angular momentum of the gas also plays a crucial role in determining the scale length of the counterrotating disk formed and the time it takes to form. The rate of infall, i.e. the mass of gas falling in per unit time, has to be small enough to preclude excessive heating of the preexisting disk. It is much easier in general to produce a smaller counterrotating disk than it is to produce an extensive disk whose scale length is similar to that of the original prograde disk. A gas-rich dwarf merger does not appear to be a viable mechanism to produce a massive counterrotating disk, because only a very small dwarf galaxy can produce a counterrotating disk without increasing the thickness of the existing disk by an order of magnitude, and the time-scale for this process is prohibitively long because it makes it very unlikely that several such mergers can accumulate a massive counterrotating disk over a Hubble time.
Explorez l'arbre d'article
Cliquez sur les nœuds de l'arborescence pour être redirigé vers un article donné et accéder à leurs résumés et assistant virtuel
Recherchez des articles similaires (en version bêta)
En cliquant sur le bouton ci-dessus, notre algorithme analysera tous les articles de notre base de données pour trouver le plus proche en fonction du contenu des articles complets et pas seulement des métadonnées. Veuillez noter que cela ne fonctionne que pour les articles pour lesquels nous avons généré des résumés et que vous pouvez le réexécuter de temps en temps pour obtenir un résultat plus précis pendant que notre base de données s'agrandit.