Rational cubic clipping with linear complexity for computing roots of polynomials

Many problems in computer aided geometric design and computer graphics can be turned into a root-finding problem of polynomial equations. Among various clipping methods, the ones based on the Bernstein–Bézier form have good numerical stability. One of such clipping methods is the k-clipping method,...

Full description

Bibliographic Details

Published in:	Applied mathematics and computation Vol. 273; pp. 1051 - 1058
Main Authors:	Chen, Xiao-diao, Ma, Weiyin
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.01.2016
Subjects:	Approximation order Convergence rate Fast cubic clipping method Linear computational complexity Root-finding Convergence rate Fast cubic clipping method Linear computational complexity Root-finding Approximation order
ISSN:	0096-3003, 1873-5649
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!