Abstract
Computing upper bounds of the positive real roots of some polynomials is a key step of those real root isolation algorithms based on continued fraction expansion and Vincent's theorem. The authors give a new algorithm for computing an upper bound of positive roots in this paper. The complexity of the algorithm is O(n log(u+1)) additions and multiplications where u is the optimal upper bound satisfying Theorem 3.1 of this paper and n is the degree of the polynomial. The method together with some tricks have been implemented as a software package logcf using C language. Experiments on many benchmarks show that logcf is competitive with RootIntervals of Mathematica and the function realroot of Maple averagely and it is much faster than existing open source real root solvers in many test cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
