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,...

Celý popis

Podrobná bibliografia

Vydané v:	Applied mathematics and computation Ročník 273; s. 1051 - 1058
Hlavní autori:	Chen, Xiao-diao, Ma, Weiyin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.01.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!