From a659a1f2eae685a79b100bdaf3fbeac37a4c936c Mon Sep 17 00:00:00 2001 From: lilia Date: Wed, 20 Aug 2014 17:51:56 +0200 Subject: [PATCH] v2-20-08-2014 --- paper.tex | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/paper.tex b/paper.tex index 3b10cc6..8bef816 100644 --- a/paper.tex +++ b/paper.tex @@ -542,8 +542,7 @@ Iterative methods are become more attractive than direct ones to solve large spa The most successful iterative methods currently available are those based on the Krylov subspace which consists in forming a basis of a sequence of successive matrix powers times the initial residual. These methods are based on orthogonality of vectors of the Krylov subspace basis to solve generalized linear systems. The most well-known iterative Krylov subspace methods are Conjugate Gradient method and GMRES method (generalized minimal residual). -%les chercheurs ont développer différentes méthodes exemple de méthode iteratives stationnaires et non stationnaires (krylov) -%problème de convergence et difficulté dans le passage à l'échelle +However, the iterative methods suffer from scalability problems on parallel computing platforms with many processors due to their need for reduction operations and collective communications to perform matrix-vector multiplications. %%%********************************************************* %%%********************************************************* -- 2.39.5