Integer Arithmetic Algorithms for Polynomial Real Zero Determination
Journal of the ACM (JACM)
Polynomial real root isolation by differentiation
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Cost reduction on roots pre-isolation
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Comparative methods for the polynomial isolation
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
| Hi-index | 0.00 |
It is known that, if all the roots of a polynomial are real, they can be localizing, using a set of intervals, which contain the arithmetic average of the roots. The aim of this paper is to give an original method for evaluating and improving the 'polynomial minimum root separation' results, for the polynomials having all real roots. We use Hadamard inequality and new original inequalities. Also we make some considerations about the cost for isolate the polynomial roots. Our method is based on the construction of new intervals containing only one root of the polynomial.