crp/OpenMC
1
0
Fork 0
mirror of https://github.com/openmc-dev/openmc.git synced 2026-07-28 06:05:58 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions 5

minor typo fix

Browse source
This commit is contained in:
Jonathan 2022-02-14 23:36:14 +00:00
parent c8639e1630
commit 1da0eac5d5
10 changed files with 13 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

4
docs/source/methods/parallelization.rst
View file

@ -293,7 +293,7 @@ Cost of Nearest Neighbor Algorithm
----------------------------------
With the communication cost of the traditional fission bank algorithm
quantified, we now proceed to discuss the communicatin cost of the proposed
quantified, we now proceed to discuss the communication cost of the proposed
algorithm. Comparing the cost of communication of this algorithm with the
traditional algorithm is not trivial due to fact that the cost will be a
function of how many fission sites are sampled on each node. If each node
@ -398,7 +398,7 @@ equation :eq:`k-to-source`, we can relate the stochastic eigenvalue to the
integral of the noise component of the source distribution as
.. math::
:label: noise-integeral
:label: noise-integral
N\hat{k} = Nk + \sqrt{N} \int \hat{\epsilon}(\mathbf{r}) \: d\mathbf{r}.