X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/a6f49b2fbc6ccf037f7358f1e306f275576518fd..108b6ffda00e3d8bf697f0f6ee88c0c6e9d53e3f:/hpcc.tex?ds=sidebyside diff --git a/hpcc.tex b/hpcc.tex index dc83bb4..6a39362 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -383,8 +383,8 @@ exchanged by message passing using MPI non-blocking communication routines. \begin{figure}[!t] \centering - \includegraphics[width=60mm,keepaspectratio]{clustering2} -\caption{Example of two distant clusters of processors.} + \includegraphics[width=60mm,keepaspectratio]{clustering} +\caption{Example of three distant clusters of processors.} \label{fig:4.1} \end{figure} @@ -422,7 +422,7 @@ u =0 \text{~on~} \Gamma =\partial\Omega \right. \label{eq:02} \end{equation} -where $\nabla^2$ is the Laplace operator, $f$ and $u$ are real-valued functions, and $\Omega=[0,1]^3$. The spatial discretization with a finite difference scheme reduces problem~(\ref{eq:02}) to a system of sparse linear equations. Our multisplitting method solves the 3D Poisson problem using a seven point stencil whose the general expression could be written as +where $\nabla^2$ is the Laplace operator, $f$ and $u$ are real-valued functions, and $\Omega=[0,1]^3$. The spatial discretization with a finite differences scheme reduces problem~(\ref{eq:02}) to a system of sparse linear equations. Our multisplitting method solves the 3D Poisson problem using a seven point stencil whose the general expression could be written as \begin{equation} \begin{array}{l} u(x-1,y,z) + u(x,y-1,z) + u(x,y,z-1)\\+u(x+1,y,z)+u(x,y+1,z)+u(x,y,z+1) \\ -6u(x,y,z)=h^2f(x,y,z),