Geodesic
Computing Real Zeros of a Polynomial by Branch and Bound and Branch and Reduce Algorithms
Yugoslav journal of operations research, Tome 24 (2014) no. 1, p. 53 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

In this paper we propose two algorithms based on branch and bound method and reduced interval techniques to compute all real zeros of a polynomial. Quadratic bounding functions are proposed which are better than the well known linear underestimator. Experimental result shows the efficiency of the two algorithms when facing ill-conditioned polynomials.
Classification : 26C10, 90C20, 90C25, 90C90.
Keywords: Keywords: Global optimization quadratic upper function quadratic lower functionroot-finding Bound and Reduce Branch and Bound w-subdivision 
@article{YJOR_2014_24_1_a3,
     author = {Hoai An Le Thi and Mo and and Ouanes and Ahmed Zidna},
     title = {Computing {Real} {Zeros} of a {Polynomial} by {Branch} and {Bound} and {Branch} and {Reduce} {Algorithms}},
     journal = {Yugoslav journal of operations research},
     pages = {53 },
     year = {2014},
     volume = {24},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a3/}
}
TY  - JOUR
AU  - Hoai An Le Thi
AU  - Mo
AU  - and Ouanes
AU  - Ahmed Zidna
TI  - Computing Real Zeros of a Polynomial by Branch and Bound and Branch and Reduce Algorithms
JO  - Yugoslav journal of operations research
PY  - 2014
SP  - 53 
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a3/
LA  - en
ID  - YJOR_2014_24_1_a3
ER  - 
%0 Journal Article
%A Hoai An Le Thi
%A Mo
%A and Ouanes
%A Ahmed Zidna
%T Computing Real Zeros of a Polynomial by Branch and Bound and Branch and Reduce Algorithms
%J Yugoslav journal of operations research
%D 2014
%P 53 
%V 24
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a3/
%G en
%F YJOR_2014_24_1_a3
Hoai An Le Thi; Mo; and Ouanes; Ahmed Zidna. Computing Real Zeros of a Polynomial by Branch and Bound and Branch and Reduce Algorithms. Yugoslav journal of operations research, Tome 24 (2014) no. 1, p. 53 . http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a3/