相关论文: Parallel TreeSPH: A Tool for Galaxy Formation

Tree codes that approximate groups of distant particles with multipole expansions are the standard way to accelerate the computation of self-gravity on particles. While momentum-conserving fast multipole methods exist, parallelisation is…

Multidimensional nucleosynthesis studies with hundreds of nuclei linked through thousands of nuclear processes are still computationally prohibitive. To date, most nucleosynthesis studies rely either on hydrostatic/hydrodynamic simulations…

We describe a parallel, cosmological N-body code based on a hybrid scheme using the particle-mesh (PM) and Barnes-Hut (BH) oct-tree algorithm. We call the algorithm GOTPM for Grid-of-Oct-Trees-Particle-Mesh. The code is parallelized using…

In this paper we report on PD-SPH the new tree-sph code developed in Padua. The main features of the code are described and the results of a new and independent series of 1-D and 3-D tests are shown. The paper is mainly dedicated to the…

We have been constructed a brand-new radiation hydrodynamics solver based upon Smoothed Particle Hydrodynamics (SPH), which works on parallel computer system. The code is designed to investigate the formation and evolution of the first…

We have developed a parallel Particle-Particle, Particle-Mesh (P^3M) simulation code for the T3E well suited to studying the time evolution of systems of particles interacting via gravity and gas forces in cosmological contexts. The…

Cosmological simulations of structures and galaxies formations have played a fundamental role in the study of the origin, formation and evolution of the Universe. These studies improved enormously with the use of supercomputers and parallel…

We present a modified TREESPH code to model galaxies in 3d. The model includes a multi-phase description of the interstellar medium which combines two numerical techniques. A diffuse warm/hot gas phase is modelled by SPH while a sticky…

We provide a description of the SNSPH code--a parallel 3-dimensional radiation hydrodynamics code implementing treecode gravity, smooth particle hydrodynamics, and flux-limited diffusion transport schemes. We provide descriptions of the…

We present numerical simulations of galaxy formation, one of the most challenging problems in computational astrophysics. The key point in such simulations is the efficient solution of the N--body problem. If the gas of a galaxy is treated…

Merger trees track the hierarchical assembly of dark matter halos across cosmic time and serve as essential inputs for semi-analytic models of galaxy formation. However, conventional methods for constructing merger trees rely on ad-hoc…

The Smoothed Particles Hydrodynamics (SPH) is a particle-based, meshfree, Lagrangian method used to simulate multidimensional fluids with arbitrary geometries, most commonly employed in astrophysics, cosmology, and computational…

N-body codes to perform simulations of the origin and evolution of the Large Scale Structure of the Universe have improved significantly over the past decade both in terms of the resolution achieved and of reduction of the CPU time.…

We discuss the design and implementation of HYDRA_OMP a parallel implementation of the Smoothed Particle Hydrodynamics-Adaptive P3M (SPH-AP3M) code HYDRA. The code is designed primarily for conducting cosmological hydrodynamic simulations…

In this letter we describe the pseudoparticle multipole method (P2M2), a new method to express multipole expansion by a distribution of pseudoparticles. We can use this distribution of particles to calculate high order terms in both the…

A highly adaptive load balancing algorithm for parallel simulations using particle methods, such as molecular dynamics and smoothed particle hydrodynamics (SPH), is developed. Our algorithm is based on the dynamic spatial decomposition of…

A merge tree is a topological descriptor of a real-valued function. Merge trees are used in visualization and topological data analysis, either directly or as a means to another end: computing a 0-dimensional persistence diagram,…

We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a "top-down" fashion by "recursive coordinate bisection" where on each tree level we split the…

Gravitational $N$-body simulations calculate numerous interactions between particles. The tree algorithm reduces these calculations by constructing a hierarchical oct-tree structure and approximating gravitational forces on particles. Over…

We have implemented a parallel version of the Barnes-Hut 3-D N-body tree algorithm under PVM 3.2.5, adopting an SPMD paradigm. We parallelize the problem by decomposing the physical domain by means of the {\bf Orthogonal Recursive…