A rational cubic clipping method for computing real roots of a polynomial

DOI10.1016/j.cagd.2015.08.002zbMath1417.65130OpenAlexW1845768963MaRDI QIDQ1632370

Weiyin Ma, Yangtian Ye, Xiao-Diao Chen

Publication date: 14 December 2018

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2015.08.002

zbMATH Keywords

convergence rateapproximation orderroot-findingrational cubic clipping method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (6)

Revisiting the problem of zeros of univariate scalar Béziers ⋮ Piecewise quadratic bounding functions for finding real roots of polynomials ⋮ Polynomials root-finding using a SLEFE-based clipping method ⋮ An improved rational cubic clipping method for computing real roots of a polynomial ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Convergence analysis on a second order algorithm for orthogonal projection onto curves

Uses Software

• ISOLATE

Cites Work

• Bézier clipping is quadratically convergent
• Fast approach for computing roots of polynomials using cubic clipping
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Subdivision methods for solving polynomial equations
• On the numerical condition of polynomials in Bernstein form
• The dual basis functions for the Bernstein polynomials
• A bibliography on roots of polynomials
• Efficient isolation of polynomial's real roots.
• An unconditionally convergent method for computing zeros of splines and polynomials
• On the optimal stability of the Bernstein basis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A rational cubic clipping method for computing real roots of a polynomial