An unconditionally convergent method for computing zeros of splines and polynomials

We present a simple and ecient method for computing zeros of spline functions. The method exploits the close relationship between a spline and its control polygon and is based on repeated knot insertion. Like Newton’s method it is quadratically convergent, but the new method overcomes the principal problem with Newton’s method in that it always converges and no starting value needs to be supplied by the user.

[1]  Melvin R. Spencer.  Polynomial real root finding in Bernstein form , 1994 .

[2]  A. Booth.  Numerical Methods , 1957, Nature.

[3]  Thomas A. Grandine.  Computing zeroes of spline functions , 1989, Comput. Aided Geom. Des..

[4]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[5]  W. Boehm.  Inserting New Knots into B-spline Curves , 1980 .

[6]  Tomoyuki Nishita,et al.  Ray tracing trimmed rational surface patches , 1990, SIGGRAPH.

[7]  Alyn P. Rockwood,et al.  Real-time rendering of trimmed surfaces , 1989, SIGGRAPH.

[8]  L. Schumaker.  Spline Functions: Basic Theory , 1981 .