From: couturie <raphael.couturier@univ-fcomte.Fr>
Date: Tue, 20 Oct 2015 11:21:05 +0000 (+0200)
Subject: new
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/commitdiff_plain/e11b41ec23ed79334b53484f47df2731f407c8fe?ds=inline;hp=a8b5d85346363a68616d59b94c83ac7f6a83a9bf

new
---

diff --git a/paper.tex b/paper.tex
deleted file mode 100644
index a9e613e..0000000
--- a/paper.tex
+++ /dev/null
@@ -1 +0,0 @@
-blabla je viens de faire quelque modification de test
diff --git a/paper1.tex b/paper1.tex
deleted file mode 100644
index 40e80bb..0000000
--- a/paper1.tex
+++ /dev/null
@@ -1,16 +0,0 @@
-\documentclass[11pt,a4paper]{article}
-\usepackage[latin1]{inputenc}
-\usepackage{amsmath}
-\usepackage{amsfonts}
-\usepackage{amssymb}
-\author{ghidouche}
-\title{Paper1_kahina}
-\begin{document}
-\section{Root finding problem}
-we consider a polynomial 
-$p(x)=\sum{a_{i}x^{i}}=a_{n}\prod(x-\alpha_{i}), a_{0} a_{n}\neq0,$
-of degree \textit{n}having coefficients in the complex \textit{c} and zeros \alpha_{i},\textit{i=1,...,n}.
-the root finding problem consiste to find all n root of \textit{p(x)}. the problem of finding a root is equivalent to the problem of finding a fixed-point. To see this consider the fixed-point problem of finding the
-n-dimensional vector x such that
-
-\end{document}
\ No newline at end of file