From: couturie <couturie@extinction>
Date: Sun, 15 Dec 2013 16:36:43 +0000 (+0100)
Subject: new version
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/Krylov_multi.git/commitdiff_plain/fedf59562159b08c86b61f27de746deb1fd42f98?ds=inline;hp=--cc

new version
---

fedf59562159b08c86b61f27de746deb1fd42f98
diff --git a/krylov_multi.tex b/krylov_multi.tex
index 88c218a..5cf4056 100644
--- a/krylov_multi.tex
+++ b/krylov_multi.tex
@@ -1,8 +1,32 @@
 \documentclass{article}
+\usepackage[utf8]{inputenc}
+\usepackage{amsfonts,amssymb}
+\usepackage{amsmath}
+\usepackage{graphicx}
+
+\title{A scalable multisplitting algorithm for solving large sparse linear systems} 
+
+
 
 \begin{document}
+\author{Raphaël Couturier \and Lilia Ziane Khodja}
+
+\maketitle
+
+
+\begin{abstract}
+In this paper  we revist the krylov multisplitting  algorithm presented in [ref]
+which  uses a  scalar method  to minimize  the krylov  iterations computed  by a
+multisplitting algorithm. Our new  algorithm is simply a parallel multisplitting
+algorithm with  few blocks of large  size and a parallel  krylov minimization is
+used to improve the convergence. Some  large scale experiments with a 3D Poisson
+problem  are  presented. They  show  the  obtained  improvements compared  to  a
+classical GMRES both in terms of number of iterations and execution times.
+\end{abstract}
+
+\section{Introduction}
 
-This paper presents ....
-It's done...
+Iterative methods used  to solve large sparse linear systems  of the form $Ax=b$
+because they are easier to parallelize than direct ones.
 
 \end{document}