![]() |
|||
| ISSN 1088-6842(e) ISSN 0025-5718(p) | |||
|
An unconditionally convergent method for computing zeros of splines and polynomials
Author(s):
Knut
Mørken;
Martin
Reimers.
Abstract | References | Similar articles | Additional information Abstract: We present a simple and efficient 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.
Retrieve articles in Mathematics of Computation with MSC (2000): 41A15, 65D07, 65H05 Retrieve articles in all Journals with MSC (2000): 41A15, 65D07, 65H05
Knut
Mørken
Martin
Reimers
|
|
|
|||
|
© Copyright 2008, American Mathematical Society Privacy Statement |
Search the AMS |
||