A rational cubic clipping method for computing real roots of a polynomial
type: Item
instance of: scholarly article
title: A rational cubic clipping method for computing real roots of a polynomial
zbMATH Open document ID: 1417.65130
author: Xiao-Diao Chen
author: Weiyin Ma
author: Yangtian Ye
published in: Computer Aided Geometric Design
publication date: 2018-12-14T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65D17
zbMATH DE Number: 6993530
zbMATH Keywords: approximation order
zbMATH Keywords: rational cubic clipping method
zbMATH Keywords: root-finding
zbMATH Keywords: convergence rate
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: j.cagd.2015.08.002
OpenAlex ID: W1845768963
cites work: Computing roots of polynomials by quadratic clipping
cites work: Q4095322
cites work: On the numerical condition of polynomials in Bernstein form
cites work: On the optimal stability of the Bernstein basis
cites work: Q5553606
cites work: The dual basis functions for the Bernstein polynomials
cites work: Q4494289
cites work: Fast approach for computing roots of polynomials using cubic clipping
cites work: A bibliography on roots of polynomials
cites work: An unconditionally convergent method for computing zeros of splines and polynomials
cites work: Subdivision methods for solving polynomial equations
cites work: Efficient isolation of polynomial's real roots.
cites work: Curve intersection using Bézier clipping
cites work: Bézier clipping is quadratically convergent
DOI: 10.1016/J.CAGD.2015.08.002
description: scientific article; zbMATH DE number 6993530