X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/e56b60da53690d349f415b94817a340eefbf0661..bef3ec3fa44638c5f5019e5053f7f926b2b01d4d:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index d85a917..30c0596 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -669,7 +669,7 @@ stable even we vary the residual error precision from \np{E-5} to \np{E-9}. By
 increasing the matrix size up to $100^3$ elements, it was necessary to increase the
 CPU power of \np[\%]{50} to \np[GFlops]{1.5} to get the algorithm convergence and the same order of asynchronous mode efficiency.  Maintaining such processor power but increasing network throughput inter cluster up to
 \np[Mbit/s]{50}, the result of efficiency with a relative gain of 2.5 is obtained with
-high external precision of \np{E-11} for a matrix size from 110 to 150 side
+high external precision of \np{E-11} for a matrix size from $110^3$ to $150^3$ side
 elements.
 
 %For the 3 clusters architecture including a total of 100 hosts,
