Abstract

view Abstract Citations (924) References (48) Co-Reads Similar Papers Volume Content Graphics Metrics Export Citation NASA/ADS TREESPH: A Unification of SPH with the Hierarchical Tree Method Hernquist, Lars ; Katz, Neal Abstract A new, general-purpose code for evolving three-dimensional, self-gravitating fluids in astrophyics, both with and without collisionless matter, is described. In this TREESPH code, hydrodynamic properties are determined using a Monte Carlo-like approach known as smoothed particle hydrodynamics (SPH). Unlike most previous implementations of SPH, gravitational forces are computed with a hierarchical tree algorithm. Multiple expansions are used to approximate the potential of distant groups of particles, reducing the cost per step. More significantly, the improvement in efficiency is achieved without the introduction of a grid. A unification of SPH with the hierarchical tree method is a natural way of allowing for larger N within a Lagrangian framework. The data structures used to manipulate the grouping of particles can be applied directly to certain aspects of the SPH calculation. Publication: The Astrophysical Journal Supplement Series Pub Date: June 1989 DOI: 10.1086/191344 Bibcode: 1989ApJS...70..419H Keywords: Computational Fluid Dynamics; Computerized Simulation; Data Smoothing; Magnetohydrodynamics; Trees (Mathematics); Dynamical Systems; Many Body Problem; Monte Carlo Method; Spatial Resolution; Fluid Mechanics and Heat Transfer; HYDRODYNAMICS; NUMERICAL METHODS full text sources ADS |

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.