From 8f44fe5aa15f1d0795d9c1f5be461a09bc6ca4ca Mon Sep 17 00:00:00 2001
From: couturie <couturie@extinction>
Date: Mon, 2 Nov 2015 10:25:22 -0500
Subject: [PATCH] new

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

diff --git a/paper.tex b/paper.tex
index d9c3324..6507d22 100644
--- a/paper.tex
+++ b/paper.tex
@@ -229,10 +229,11 @@ and experimental study results. Finally, Section\ref{sec7} 6 concludes
 this paper and gives some hints for future research directions in this
 topic.
 
-\section{The Sequential Aberth method}
+\section{The Sequential Ehrlich-Aberth method}
 \label{sec1}
 A cubically convergent iteration method for finding zeros of
-polynomials was proposed by O. Aberth~\cite{Aberth73}. In the fellowing we present the main stages of the running of the Aberth method.
+polynomials was proposed by O. Aberth~\cite{Aberth73}. In the
+following we present the main stages of our implementation the Ehrlich-Aberth method.
 %The Aberth method is a purely algebraic derivation. 
 %To illustrate the derivation, we let $w_{i}(z)$ be the product of linear factors 
 
-- 
2.39.5