Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2014-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2014/0354-02431400004L.pdf |
| _version_ | 1811257515354095616 |
|---|---|
| author | Le Thi Hoai An Ouanes Mohand Zidna Ahmed |
| author_facet | Le Thi Hoai An Ouanes Mohand Zidna Ahmed |
| author_sort | Le Thi Hoai An |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T17:58:40Z |
| format | Article |
| id | doaj.art-8bc51d6842b0436083a82e636219a4c0 |
| institution | Directory Open Access Journal |
| issn | 0354-0243 |
| language | English |
| last_indexed | 2024-04-12T17:58:40Z |
| publishDate | 2014-01-01 |
| publisher | University of Belgrade |
| record_format | Article |
| series | Yugoslav Journal of Operations Research |
| spelling | doaj.art-8bc51d6842b0436083a82e636219a4c02022-12-22T03:22:16ZengUniversity of BelgradeYugoslav Journal of Operations Research0354-02432014-01-01241536910.2298/YJOR120620004L0354-02431400004LComputing real zeros of a polynomial by branch and bound and branch and reduce algorithmsLe Thi Hoai An0Ouanes Mohand1Zidna Ahmed2Laboratoire d'Informatique Théorique et Appliquée (LITA) Université de Lorraine, Metz, FranceDépartement de Mathématiques, Faculté des Sciences, Université de Tizi-Ouzou, AlgérieLaboratoire d'Informatique Théorique et Appliquée (LITA) Université de Lorraine, Metz, FranceIn 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.http://www.doiserbia.nb.rs/img/doi/0354-0243/2014/0354-02431400004L.pdfGlobal optimization quadratic upper function quadratic lower function root-finding Bound and Reduce Branch and Bound w-subdivision |
| spellingShingle | Le Thi Hoai An Ouanes Mohand Zidna Ahmed Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms Yugoslav Journal of Operations Research Global optimization quadratic upper function quadratic lower function root-finding Bound and Reduce Branch and Bound w-subdivision |
| title | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| title_full | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| title_fullStr | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| title_full_unstemmed | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| title_short | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| title_sort | computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
| topic | Global optimization quadratic upper function quadratic lower function root-finding Bound and Reduce Branch and Bound w-subdivision |
| url | http://www.doiserbia.nb.rs/img/doi/0354-0243/2014/0354-02431400004L.pdf |
| work_keys_str_mv | AT lethihoaian computingrealzerosofapolynomialbybranchandboundandbranchandreducealgorithms AT ouanesmohand computingrealzerosofapolynomialbybranchandboundandbranchandreducealgorithms AT zidnaahmed computingrealzerosofapolynomialbybranchandboundandbranchandreducealgorithms |