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

diff --git a/hpcc.tex b/hpcc.tex
index d9f64af..ff65e20 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -27,6 +27,8 @@
   \todo[color=green!50,#1]{\sffamily\textbf{AG:} #2}\xspace}
 \newcommand{\RC}[2][inline]{%
   \todo[color=red!10,#1]{\sffamily\textbf{RC:} #2}\xspace}
+\newcommand{\LZK}[2][inline]{%
+  \todo[color=blue!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
 
 \algnewcommand\algorithmicinput{\textbf{Input:}}
 \algnewcommand\Input{\item[\algorithmicinput]}
@@ -220,7 +222,7 @@ The global convergence of the asynchronous multisplitting solver is detected whe
 \[(k\leq \MI) \mbox{~or~} (\|X_l^k - X_l^{k+1}\|_{\infty}\leq\epsilon)\]
 where $\MI$ is the maximum number of outer iterations and $\epsilon$ is the tolerance threshold of the error computed between two successive local solution $X_l^k$ and $X_l^{k+1}$. 
 
-\RC{Description du processus d'adaptation de l'algo multisplitting à SimGrid}
+\LZK{Description du processus d'adaptation de l'algo multisplitting à SimGrid}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%