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
Determination of the parameters of the skin-electrode impedance model for ECG measurement
EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
A generalization of the remainder in multivariate polynomial interpolation
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
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
Diagonally implicit Runge-Kutta Nystrom general method order five for solving second order IVPs
WSEAS Transactions on Mathematics
| Hi-index | 0.00 |
It is known that, if all the roots of a polynomial are real, they can be localised, using a set of intervals, which contain the arithmetic average of the roots. The aim of this paper is to present an original method for giving other distributions of the roots/ modules of the roots on real axis, a method for evaluating and improving the "polynomial minimum root separation" results, a method for the complex polynomials and for polynomials having all roots real. We use the discriminant, Hadamard's inequality, Mahler's measure and new original inequalities. Also we will make some considerations about the cost for isolate the polynomial real roots. Our method is based on the successive splitting for the interval which contains all roots.