From 9213a919b9009602014fa0b33a14063f019562dc Mon Sep 17 00:00:00 2001 From: Kahina Date: Tue, 3 Nov 2015 06:20:51 +0100 Subject: [PATCH] new bib --- mybibfile.bib | 8 ++++---- paper.tex | 2 +- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/mybibfile.bib b/mybibfile.bib index cd9bf5a..7e943e1 100644 --- 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 30fe880..d9b3e5e 100644 --- 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 -- 2.39.5