new bib

diff --git a/mybibfile.bib b/mybibfile.bib
index cd9bf5ab51f73f218d302d593ab5ed10b797d7d0..7e943e1c2cc64e35090f87fb845e7ab1521dd22f 100644 (file)
--- a/mybibfile.bib
+++ b/mybibfile.bib
@@ -307,9 +307,9 @@ OPTannote = {•}
 
 
 @Book{Kalantari08,
-ALTauthor = {B. Kalantari},
-title = {Polynomial root finding and polynomiography.},
-publisher = {World Scientifict,New Jersey},
+author = {B. Kalantari},
+title = {Polynomial root finding and polynomiography},
+publisher = {World Scientifict},
 year = {2008},
 OPTkey = {•},
 OPTvolume = {•},
@@ -363,7 +363,7 @@ OPTannote = {•}
 
 
 @Article{Skachek08,
-  title =   " Structured matrix methods for polynomial root finding.",
+  title =   " Structured matrix methods for polynomial root finding",
   journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
   volume =  "",
   number =  "",

diff --git a/paper.tex b/paper.tex
index 30fe88003a8910f177d456d718ec7aa8da30208e..d9b3e5e4f47b56ba09028e037feeb8bf231109a7 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -391,7 +391,7 @@ in~\cite{Benall68,Jana06,Janall99,Riceall06}.
 
 There are many schemes for the simultaneous approximation of all roots of a given
 polynomial. Several works on different methods and issues of root
-finding have been reported in~\cite{Azad07, Gemignani07, Kalantari08, Skachek08, Zhancall08, Zhuall08}. However, Durand-Kerner and Ehrlich-Aberth methods are the most practical choices among
+finding have been reported in~\cite{Azad07, Gemignani07, Kalantari08, Zhancall08, Zhuall08}. However, Durand-Kerner and Ehrlich-Aberth methods are the most practical choices among
 them~\cite{Bini04}. These two methods have been extensively
 studied for parallelization due to their intrinsics parallelism, i.e. the
 computations involved in both methods has some inherent