2011
DOI: 10.1051/0004-6361/201014949
|View full text |Cite
|
Sign up to set email alerts
|

SEREN – a new SPH code for star and planet formation simulations

Abstract: We present SEREN, a new hybrid Smoothed Particle Hydrodynamics and N-body code designed to simulate astrophysical processes such as star and planet formation. It is written in Fortran 95/2003 and has been parallelised using OpenMP. SEREN is designed in a flexible, modular style, thereby allowing a large number of options to be selected or disabled easily and without compromising performance. SEREN uses the conservative "grad-h" formulation of SPH, but can easily be configured to use traditional SPH or Godunov … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
110
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 100 publications
(111 citation statements)
references
References 73 publications
1
110
0
Order By: Relevance
“…We use an MPI-parallelized version of the SEREN (Hubber et al, 2010) code to simulate cloud-cloud collisions with smoothed particle hydrodynamics (SPH). We include self-gravity.…”
Section: Methodsmentioning
confidence: 99%
“…We use an MPI-parallelized version of the SEREN (Hubber et al, 2010) code to simulate cloud-cloud collisions with smoothed particle hydrodynamics (SPH). We include self-gravity.…”
Section: Methodsmentioning
confidence: 99%
“…Numerical simulations were performed using the well-tested smoothed particle hydrodynamics (SPH) code SEREN in its energy and momentum conserving formalism with an adaptive gravitational softening length (Hubber et al 2011). Simulations were developed with the standard cubic spline kernel with each SPH particle having approximately 50 neighbours.…”
Section: Numerical Algorithmmentioning
confidence: 99%
“…The implementation strategy, however, is not restricted to this type of tree and can straightforwardly be adapted to other tree types such as octree (Barnes & Hut 1986) or other binary trees (Benz et al 1990). The RCB tree is not built down to the last particle, but down to small groups of adjacent particles that are always aggregated into what we call "lowest-level cells" (or ll-cells), also found in the "tree literature" as "leaves" (Oxley & Woolfson 2003;Springel 2005;Gaburov et al 2010;Hubber et al 2011;Clark et al 2012) or as "buckets" (Dikaiakos & Stadel 1996;Stadel 2001;Wadsley et al 2004). Since the average number of particles per ll-cell (typically ∼12) is much smaller than the average neighbor number (∼100), the size of any ll-cell will always be smaller than the smoothing length of its particles.…”
Section: Performing the Integrationmentioning
confidence: 99%