Skip to content
GitLab
Menu
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
SWIFT
SWIFTsim
Commits
50607f0f
Commit
50607f0f
authored
Apr 12, 2016
by
Pedro Gonnet
Browse files
tweak wording a bit.
parent
dd0f4578
Changes
1
Show whitespace changes
Inline
Side-by-side
theory/paper_pasc/pasc_paper.tex
View file @
50607f0f
...
...
@@ -364,16 +364,16 @@ The tree-based neighbour-finding described above was replaced with a more
task-friendly approach as described in
\cite
{
ref:Gonnet2015
}
, in which
the domain is first decomposed into a grid of
{
\em
cells
}
of edge length
larger or equal to the largest particle radius.
An initial set of interaction tasks is then defined over all
neighbouring
pairs of cells such that if two particles are close enough to interact,
An initial set of interaction tasks is then defined over all
cells and
pairs of
neighbouring
cells
,
such that if two particles are close enough to interact,
they are either in the same cell or they span a pair of neighbouring cells.
These initial interaction tasks are then refined by recursively
splitting cells that contain more than a certain number of particles
and replacing tasks that span a pair of split cells with tasks
spanning the neighboring sub-cells.
The resulting refined set of tasks contains all the cells and pairs of cells
over which particle interactions must be computed.
Particle interactions are computed within, and between pairs, of
hierarchical cells containing one or more particles.
The dependencies between the tasks are set following
equations
\eqn
{
rho
}
,
\eqn
{
dvdt
}
, and
\eqn
{
dudt
}
, i.e.~such that for any cell,
all the tasks computing the particle densities therein must have
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment