From 9c7da73f4672639a56d032402179d466b8bad238 Mon Sep 17 00:00:00 2001 From: lilia Date: Thu, 21 Aug 2014 12:16:00 +0200 Subject: [PATCH 1/1] v0-21-08-2014 --- paper.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/paper.tex b/paper.tex index 8bef816..f7590c0 100644 --- a/paper.tex +++ b/paper.tex @@ -540,9 +540,9 @@ Iterative Krylov methods; sparse linear systems; error minimization; PETSC; %à % (should never be an issue) Iterative methods are become more attractive than direct ones to solve large sparse linear systems. They are more effective in a parallel context and require less memory and arithmetic operations than direct methods. A number of iterative methods are proposed and adapted by many researchers and the increased need for solving very large sparse linear systems triggered the development of efficient iterative techniques suitable for the parallel processing. -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). +The most successful iterative methods currently available are those based on Krylov subspaces which consist in forming a basis of a sequence of successive matrix powers times an initial vector for example the residual. These methods are based on orthogonality of vectors of the Krylov subspace basis to solve linear systems. The most well-known iterative Krylov subspace methods are Conjugate Gradient method and GMRES method (generalized minimal residual). -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. +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. The communications on large clusters with thousands of cores and large sizes of messages can significantly affect the performances of iterative methods. In practice, Krylov subspace iteration methods are often used with preconditioners in order to increase their convergence and accelerate their performances. However, most of the good preconditioners are not scalable on large clusters. %%%********************************************************* %%%********************************************************* @@ -563,7 +563,7 @@ However, the iterative methods suffer from scalability problems on parallel comp \section{A Krylov two-stage algorithm} We propose a two-stage algorithm to solve large sparse linear systems of the form $Ax=b$, where $A\in\mathbb{R}^{n\times n}$ is a sparse and square nonsingular matrix, $x\in\mathbb{R}^n$ is the solution vector and $b\in\mathbb{R}^n$ is the right-hand side. The algorithm is implemented as an inner-outer iteration solver based on iterative Krylov methods. The main key points of our solver are given in Algorithm~\ref{algo:01}. -In order to accelerate the convergence, the outer iteration is implemented as an iterative Krylov method which minimizes some error function over a Krylov sub-space~\cite{saad96}. At every iteration, the sparse linear system $Ax=b$ is solved iteratively with an iterative method as GMRES method~\cite{saad86} and the Krylov sub-space that we used is spanned by a basis $S$ composed of successive solutions issued from the inner iteration +In order to accelerate the convergence, the outer iteration is implemented as an iterative Krylov method which minimizes some error function over a Krylov subspace~\cite{saad96}. At every iteration, the sparse linear system $Ax=b$ is solved iteratively with an iterative method as GMRES method~\cite{saad86} and the Krylov subspace that we used is spanned by a basis $S$ composed of successive solutions issued from the inner iteration \begin{equation} S = \{x^1, x^2, \ldots, x^s\} \text{,~} s\leq n. \end{equation} -- 2.39.5