Polynomials root-finding using a SLEFE-based clipping method

DOI10.1007/S40304-016-0086-1MaRDI QIDQ2397808zbMATH OpenOpenAlexFDO

Authors Ping Jiang, Xingqiao Wu, Zhi Liu

Publication date 23 May 2017

Published in Communications in Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40304-016-0086-1

zbMATH Keywords

clipping algorithmisolation algorithmpolynomial root-findingreal root interval isolationroots of polynomialssubdividable linear efficient function enclose

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Review text

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.

Recommendations

• A rational cubic clipping method for computing real roots of a polynomial
• Fast approach for computing roots of polynomials using cubic clipping
• Computing roots of polynomials by quadratic clipping
• An improved rational cubic clipping method for computing real roots of a polynomial
• Efficient rational quadratic clipping method for computing roots of a polynomial

Cites work

• A rational cubic clipping method for computing real roots of a polynomial
• Basic principles of mechanical theorem proving in elementary geometries
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Efficient one-sided linearization of spline geometry
• Fast approach for computing roots of polynomials using cubic clipping
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 2163086 (Why is no real title available?)
• Mathematical problems for the next century
• Rational cubic clipping with linear complexity for computing roots of polynomials
• Sleves for planar spline curves

Cited in

(3)

• Piecewise quadratic bounding functions for finding real roots of polynomials
• scientific article; zbMATH DE number 2064520 (Why is no real title available?)
• Rational cubic clipping with linear complexity for computing roots of polynomials

Describes a project that uses

Uses Software

• SubLiME

This page was built for publication: Polynomials root-finding using a SLEFE-based clipping method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397808)