Robust Algorithm for Solving Univariate Polynomial Equations

• Comparison with IPP algorithm

  • Time Complexity per step
    • IPP : O(m2)
    • Proposed Algorithm : O(mnp)

• Performance comparison with IPP algorithm

  • Isolated simple roots : the IPP algorithm
  • Roots with high multiplicity : the proposed algorithm

m : degree

np : number of sample points

Test Polynomial: p(x) = (x-1/2)m = 0

Elapsed Time (seconds)

Previous slide

Next slide

Back to first slide

View graphic version