Fast approach for computing roots of polynomials using cubic clipping

DOI10.1016/J.CAGD.2009.02.003MaRDI QIDQ625270zbMATH OpenOpenAlexFDO

Authors Lei Zhang, Binbin Lin, Guojin Wang, Ligang Liu

Publication date 15 February 2011

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

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

zbMATH Keywords

cubic clippingpolynomialquadratic clippingroot finding

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to single equations (65H05)

Recommendations

• Computing roots of polynomials by quadratic clipping
• A rational cubic clipping method for computing real roots of a polynomial
• 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

Cites work

• A bibliography on roots of polynomials
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Efficient isolation of polynomial's real roots.
• scientific article; zbMATH DE number 1487774 (Why is no real title available?)
• scientific article; zbMATH DE number 826245 (Why is no real title available?)
• The dual basis functions for the Bernstein polynomials

Cited in

(17)

• A rational cubic clipping method for computing real roots of a polynomial
• Revisiting the problem of zeros of univariate scalar Béziers
• Efficient rational quadratic clipping method for computing roots of a polynomial
• An improved rational cubic clipping method for computing real roots of a polynomial
• Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials
• Fast and accurate evaluation of dual Bernstein polynomials
• Differential-recurrence properties of dual Bernstein polynomials
• Polynomials root-finding using a SLEFE-based clipping method
• Construction of dual B-spline functions
• Bézier representation of the constrained dual Bernstein polynomials
• Rational cubic clipping with linear complexity for computing roots of polynomials
• Progressive explicit formulae for root-finding problems based on reparameterization
• A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
• A reliable method for finding intersections of 2D NURBS curves
• Computing roots of polynomials by quadratic clipping
• Dual Gauss-Legendre polynomials
• Real-time rendering of algebraic B-spline surfaces via Bézier point insertion

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: Fast approach for computing roots of polynomials using cubic clipping

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