Polynomials root-finding using a SLEFE-based clipping method (Q2397808): Difference between revisions

Based on the theory of subdividable linear efficient function enclose (SLEFE), the SLEFE clipping algorithm and the SLEFE isolation algorithm are proposed. The SLEFE clipping algorithm requires fewer iterations and consumes less computation time to solve the root-finding problems which have only one root within a given interval. The SLEFE isolation algorithm can compute all the intervals that contain the roots of polynomials rapidly and accurately.