From 42e7f35fe290785950e094b86fd73c998719025f Mon Sep 17 00:00:00 2001 From: lilia Date: Mon, 28 Apr 2014 17:19:49 +0200 Subject: [PATCH] v3 --- hpcc.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hpcc.tex b/hpcc.tex index b2509c1..5a03bb2 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -232,7 +232,7 @@ asynchronous iterative algorithms comes from the fact it is necessary to run the with real data. In fact, from an execution to another the order of messages will change and the number of iterations to reach the convergence will also change. According to all the parameters of the platform (number of nodes, power of -nodes, inter and intra clusrters bandwith and latency, ....) and of the +nodes, inter and intra clusrters bandwith and latency, etc.) and of the algorithm (number of splitting with the multisplitting algorithm), the multisplitting code will obtain the solution more or less quickly. Or course, the GMRES method also depends of the same parameters. As it is difficult to have -- 2.39.5