Polynomials root-finding using a SLEFE-based clipping method

DOI10.1007/s40304-016-0086-1zbMath1367.65074OpenAlexW2401825902MaRDI QIDQ2397808

Zhi Liu, Xingqiao Wu, Ping Jiang

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

roots of polynomialspolynomial root-findingclipping algorithmisolation algorithmreal root interval isolationsubdividable linear efficient function enclose

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Piecewise quadratic bounding functions for finding real roots of polynomials

Uses Software

• SubLiME

Cites Work

• Fast approach for computing roots of polynomials using cubic clipping
• Rational cubic clipping with linear complexity for computing roots of polynomials
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Basic principles of mechanical theorem proving in elementary geometries
• Mathematical problems for the next century
• A rational cubic clipping method for computing real roots of a polynomial
• Sleves for planar spline curves
• Mathematics of Surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

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