From 1df92e2629fef95f9b236c8d952d94c08f5f34a0 Mon Sep 17 00:00:00 2001
From: Kahina <kahina@kahina-VPCEH3K1E.(none)>
Date: Thu, 5 Nov 2015 10:23:52 +0100
Subject: [PATCH 1/1] new

---
 paper.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/paper.tex b/paper.tex
index f227762..1d70450 100644
--- a/paper.tex
+++ b/paper.tex
@@ -321,8 +321,8 @@ With high degree polynomial, the Ehrlich-Aberth method implementation,
 as well as the Durand-Kerner implement, suffers from overflow problems. This
 situation occurs, for instance, in the case where a polynomial
 having positive coefficients and a large degree is computed at a
-point $\xi$ where $|\xi| > 1$, where $|x|$ stands for the modolus of a complex $x$. Indeed, the limited number in the
-mantissa of floating points representations makes the computation of p(z) wrong when z
+point $\xi$ where $|\xi| > 1$, where $|z|$ stands for the modolus of a complex $z$. Indeed, the limited number in the
+mantissa of floating points representations makes the computation of $p(z)$ wrong when z
 is large. For example $(10^{50}) +1+ (- 10^{50})$ will give the wrong result
 of $0$ instead of $1$. Consequently, we can not compute the roots
 for large degrees. This problem was early discussed in
-- 
2.39.5