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

DOI10.1016/J.CAGD.2015.08.002MaRDI QIDQ1632370zbMATH OpenOpenAlexFDO

Authors Xiao-Diao Chen, Weiyin Ma, Yangtian Ye

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

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3516003 (Why is no real title available?)
• scientific article; zbMATH DE number 1487774 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• A bibliography on roots of polynomials
• An unconditionally convergent method for computing zeros of splines and polynomials
• Bézier clipping is quadratically convergent
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Efficient isolation of polynomial's real roots.
• Fast approach for computing roots of polynomials using cubic clipping
• On the numerical condition of polynomials in Bernstein form
• On the optimal stability of the Bernstein basis
• Subdivision methods for solving polynomial equations
• The dual basis functions for the Bernstein polynomials

Cited in

(11)

• Revisiting the problem of zeros of univariate scalar Béziers
• Efficient rational quadratic clipping method for computing roots of a polynomial
• Convergence analysis on a second order algorithm for orthogonal projection onto curves
• An improved 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
• Polynomials root-finding using a SLEFE-based clipping method
• The computation of multiple roots of a Bernstein basis polynomial
• Explicit formulae for progressively computing a real root of the smooth function
• Piecewise quadratic bounding functions for finding real roots of polynomials
• Rational cubic clipping with linear complexity for computing roots of polynomials

Describes a project that uses

Uses Software

• ISOLATE

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

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