From 2ff4abba7efe7ae4d178670dce9b4b473fa75c45 Mon Sep 17 00:00:00 2001 From: afanfakh Date: Tue, 19 Apr 2016 15:52:29 +0200 Subject: [PATCH] adding corrections of CH1 --- CHAPITRE_01.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/CHAPITRE_01.tex b/CHAPITRE_01.tex index 12f27f5..dd97ab9 100644 --- a/CHAPITRE_01.tex +++ b/CHAPITRE_01.tex @@ -362,7 +362,7 @@ The sequential iterative algorithm at each iteration computes the value of the r \label{eq:res} R = \max_{i=1, \dots, N} \abs{X_i^{(k+1)} - X_i^k} \end{equation} -Where $N$ is the size of the vector $X$. Then, the iterative sequential algorithm stops iterating if the maximum error between the last two successive solution vectors, as in \ref{eq:res}, is less than or equal a threshold value. Otherwise, it replaces the new vector $X^{(k+1)}$ with the old vector $X^k$ and computes a new iteration. +Where $N$ is the size of the vector $X$. Then, the iterative sequential algorithm stops iterating if the maximum error between the last two successive solution vectors, as in \ref{eq:res}, is less than or equal to a threshold value. Otherwise, it replaces the new vector $X^{(k+1)}$ with the old vector $X^k$ and computes a new iteration. \subsection{Synchronous Parallel Iterative method} \label{ch1:3:1} @@ -404,7 +404,7 @@ For example, in MPI this operation is directly applied using a high level commun \begin{figure}[h!] \centering \includegraphics[scale=0.75]{fig/ch1/sisc.pdf} -\caption{The SICS Model} +\caption{The SISC Model} \label{fig:ch1:15} \end{figure} @@ -420,7 +420,7 @@ Accordingly, this algorithm can be effectively run over a local cluster, where \begin{figure}[h!] \centering \includegraphics[scale=0.75]{fig/ch1/siac.pdf} -\caption{The SIAS Model} +\caption{The SIAC Model} \label{fig:ch1:16} \end{figure} -- 2.39.5