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: | Le Thi Hoai An, Ouanes Mohand, Zidna Ahmed |
---|---|
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 |
Similar Items
-
Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver
by: Keisuke Otaki, et al.
Published: (2023-03-01) -
Estimating the Quadratic Form <i>x</i><sup>T</sup><i>A</i><sup>−m</sup><i>x</i> for Symmetric Matrices: Further Progress and Numerical Computations
by: Marilena Mitrouli, et al.
Published: (2021-06-01) -
Bounded Surjective Quadratic Functions over Fnp for MPC-/ZK-/FHE-Friendly Symmetric Primitives
by: Lorenzo Grassi
Published: (2023-06-01) -
A Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem
by: Chenyang Hu, et al.
Published: (2022-01-01) -
A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers
by: Chung-Ho Su, et al.
Published: (2022-04-01)