Fast approach for computing roots of polynomials using cubic clipping

Authors:
Ligang Liu;Lei Zhang;Binbin Lin;Guojin Wang
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, China and State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China;Department of Mathematics, Zhejiang University, Hangzhou, China and State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China;Department of Mathematics, Zhejiang University, Hangzhou, China and State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China;Department of Mathematics, Zhejiang University, Hangzhou, China and State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China
Venue:
Computer Aided Geometric Design
Year:
2009

Citing 11
Cited 4

Using Sturm sequences to bracket real roots of polynomial equations

Graphics gems
Ray tracing trimmed rational surface patches

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Curve intersection using Be´zier clipping

Computer-Aided Design - Special Issue: Be´zier Techniques
A bibliography on roots of polynomials

Journal of Computational and Applied Mathematics
Geometric constraint solver using multivariate rational spline functions

Proceedings of the sixth ACM symposium on Solid modeling and applications
Polynomial real root isolation using Descarte's rule of signs

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Robust and numerically stable Bézier clipping method for ray tracing NURBS surfaces

Proceedings of the 21st spring conference on Computer graphics
Computing roots of polynomials by quadratic clipping

Computer Aided Geometric Design
Solving nonlinear polynomial systems in the barycentric Bernstein basis

The Visual Computer: International Journal of Computer Graphics
Continuous Collision Detection for Two Moving Elliptic Disks

IEEE Transactions on Robotics

SMI 2012: Full Curve intersection using hybrid clipping

Computers and Graphics
Construction of dual bases

Journal of Computational and Applied Mathematics
Construction of dual B-spline functions

Journal of Computational and Applied Mathematics
Optimal multi-degree reduction of Bézier curves with geometric constraints

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approach, called cubic clipping, for computing all the roots of a given polynomial within an interval. In every iterative computation step, two cubic polynomials are generated to enclose the graph of the polynomial within the interval of interest. A sequence of intervals is then obtained by intersecting the sequence of strips with the abscissa axis. The sequence of these intervals converges to the corresponding root with the convergence rate 4 for the single roots, 2 for the double roots and super-linear 43 for the triple roots. Numerical examples show that cubic clipping has many expected advantages over Bezier clipping and quadratic clipping. We also extend our approach by enclosing the graph of the polynomial using two lower degree k