Rational cubic clipping with linear complexity for computing roots of polynomials

DOI10.1016/j.amc.2015.10.054zbMath1410.65139OpenAlexW2197075833MaRDI QIDQ668578

Weiyin Ma, Xiao-Diao Chen

Publication date: 19 March 2019

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

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

zbMATH Keywords

convergence rateapproximation orderroot-findingfast cubic clipping methodlinear computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of roots of polynomial equations (65H04)

Related Items (5)

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 ⋮ An approach to computing multipoint inversion and multiray surface intersection on parametric surface ⋮ Convergence analysis on a second order algorithm for orthogonal projection onto curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast approach for computing roots of polynomials using cubic clipping
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• The dual basis functions for the Bernstein polynomials
• An unconditionally convergent method for computing zeros of splines and polynomials
• On the optimal stability of the Bernstein basis

This page was built for publication: Rational cubic clipping with linear complexity for computing roots of polynomials