Abstract
In this article, we discuss the current status of polynomial factoring (root finding) algorithms with some historical and mathematical background including size limits, convergence, accuracy and speed. The methods of root approximation versus root refinement are also examined. We then focus on two improved general purpose computational techniques, and in particular the factorization algorithm by Lindsey-Fox (L-F), which makes use of the fast Fourier transform to factor polynomials with random coefficients of degrees as high as 1 million. Computer simulations give insight that result in significant improvements in traditional approaches to an ancient problem.
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.
