An unconditionally convergent method for computing zeros of splines and polynomials

Mathematics of Computation

Volumn 76, Issue 258, 2007, Pages 845-865

  Mørken, Knut ^a   Reimers, Martin ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 42949174872     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-07-01923-0     Document Type: Article

References (8)

1. W. Boehm. Inserting new knots into B-spline curves. Computer Aided Design, 12:199-201, 1980.
2. G. Dahlquist and A. Björck. Numerical Methods. Wiley-Interscience, 1980.
3. T. A. Grandine. Computing zeroes of spline functions. Computer Aided Geometric Design, 6:129-136, 1989. MR992731 (90a:65115)
4. T. Lyche and K. Mørken. Spline Methods, draft. Deparment of Informatics, University of Oslo, http://heim.ifi.uio.no/~knutm/komp04.pdf, 2004.
5. T. Nishita, T. W. Sederberg, and M. Kakimoto. Ray tracing trimmed rational surface patches. In Proceedings of the 17th annual conference on Computer graphics and interactive techniques, pages 337-345. ACM Press, 1990.
6. A. Rockwood, K. Heaton, and T. Davis. Real-time Rendering of Trimmed Surfaces. Computer Graphics, 23(3), 1989.
7. L. L. Schumaker. Spline functions: Basic theory. Prentice Hall, 1974.
8. M. R. Spencer. Polynomial real root finding in Bernstein form. Ph.D. thesis, Brigham Young University, 1994.