![](images/graphics/blank.gif)
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
14
lượt xem 0
download
lượt xem 0
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
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-conditionned polynomials.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD