gallo/atrip
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix math problems with rst

Browse Source
This commit is contained in:
Alejandro Gallo 2022-03-14 01:03:39 +01:00
parent c6eb805078
commit a2470048fb
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
atrip.org
View File

@ -55,11 +55,13 @@ As an example, for the doubles amplitudes \( T^{ab}_{ij} \), one need two kinds
** Location ** Location
Every slice set, for instance, Every slice set, for instance,
\( S_k = \left\{ $$
S_k = \left\{
a \mapsto \mathsf{T}(a)^{b}_{ij} a \mapsto \mathsf{T}(a)^{b}_{ij}
\mid \mid
a \in A_k a \in A_k
\right\} \) \right\}
$$
where \( A_k \) is some subset of where \( A_k \) is some subset of
\( \mathsf{N}_\mathrm{v} \), \( \mathsf{N}_\mathrm{v} \),
gets stored in some rank \( k \). gets stored in some rank \( k \).
@ -81,17 +83,17 @@ is therefore a simple structure:
Due to the permutation operators in the equations Due to the permutation operators in the equations
it is noticeable that for every one dimensional it is noticeable that for every one dimensional
slice and triple \( (a,b,c) \) slice and triple \( (a,b,c) \)
\begin{equation*} $$
a \mapsto \mathsf{t}(a) a \mapsto \mathsf{t}(a)
\end{equation*} $$
one needs at the same time one needs at the same time
\( \mathsf{t}(a) \), \( \mathsf{t}(a) \),
\( \mathsf{t}(b) \) and \( \mathsf{t}(b) \) and
\( \mathsf{t}(c) \). \( \mathsf{t}(c) \).
For two dimensional slices, i.e., slices of the form For two dimensional slices, i.e., slices of the form
\begin{equation*} $$
(a,b) \mapsto \mathsf{t}(a,b) (a,b) \mapsto \mathsf{t}(a,b)
\end{equation*} $$
one needs in the equations the slices one needs in the equations the slices
\( \mathsf{t}(a,b) \), \( \mathsf{t}(a,b) \),
\( \mathsf{t}(b,c) \) and \( \mathsf{t}(b,c) \) and
@ -1685,10 +1687,8 @@ three for loops creating tuples of the sort
\) \)
This means, This means,
\( (1, 2, 3) \( (1, 2, 3) , (1, 1, 3) , (1, 2, 2) \)
, (1, 1, 3) are acceptable tuples wherease \( (2, 1, 1) \) and \( (1, 1, 1) \) are not.
, (1, 2, 2)
\) are acceptable tuples wherease \( (2, 1, 1) \) and \( (1, 1, 1) \) are not.
#+begin_src c++ :tangle (atrip-tuples-h) #+begin_src c++ :tangle (atrip-tuples-h)
@ -2144,7 +2144,7 @@ Every rank gets =tuplesPerRankLocal= tuples and
the =nodeTuples= vector is now homogeneous and divisible by the number the =nodeTuples= vector is now homogeneous and divisible by the number
of ranks per node in our node. of ranks per node in our node.
Therefore, the =displacements= are simply the vector Therefore, the =displacements= are simply the vector
\begin{equation*} $$
\left\{ \left\{
k * \mathrm{tuplesPerNodeLocal} k * \mathrm{tuplesPerNodeLocal}
\mid \mid
@ -2154,7 +2154,7 @@ Therefore, the =displacements= are simply the vector
, \#\text{ranks in node} - 1 , \#\text{ranks in node} - 1
\right\} \right\}
\right\} \right\}
\end{equation*} $$
and the =sendCounts= vector is simply the constant vector and the =sendCounts= vector is simply the constant vector
=tuplesPerRankLocal= of size =ranksPerNode=. =tuplesPerRankLocal= of size =ranksPerNode=.