An improved rational cubic clipping method for computing real roots of a polynomial

DOI10.1016/j.amc.2018.12.040zbMath1429.65099OpenAlexW2911596540WikidataQ128470839 ScholiaQ128470839MaRDI QIDQ2008914

Guang Chen, Shi Li, Yigang Wang

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.040

zbMATH Keywords

convergence ratelinear complexityroot-findingrational cubic clipping method

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

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
• The dual basis functions for the Bernstein polynomials
• A rational cubic clipping method for computing real roots of a polynomial
• Parallel robots.
• On the optimal stability of the Bernstein basis

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