Content deleted Content added
Hdembinski (talk | contribs) better to index alpha with j, to avoid confusion; just "memory" instead of "memory cell" |
Hdembinski (talk | contribs) update reference |
||
Line 3:
== Introduction ==
A general introduction to B-splines is given in the [[B-spline|main article]]. Here we discuss de Boor's algorithm, an efficient and numerically stable scheme to evaluate a
:<math> \mathbf{S}(x) = \sum_i \mathbf{c}_i B_{i,p}(x). </math>
B-splines are connected piece-wise polynomial functions of
== Local support ==
B-splines have local support, meaning that the polynomials are positive only in a finite ___domain and zero elsewhere. The Cox-de Boor recursion formula<ref>C. de Boor, p.
:<math>B_{i,0}(x) := \left\{
Line 31:
== The algorithm ==
With these definitions, we can now describe de Boor's algorithm<ref>C. de Boor [1971], "Subroutine package for calculating with B-splines", Techn.Rep. LA-4728-MS, Los Alamos Sci.Lab, Los Alamos NM; p. 109, 121.</ref>. The algorithm does not compute the B-spline functions <math> B_{i,p}(x) </math> directly. Instead it evaluates <math> \mathbf{S}(x) </math> through an equivalent recursion formula.
Let <math> \mathbf{d}_{i,r} </math> be new control points with <math> \mathbf{d}_{i,0} := \mathbf{c}_{i} </math> for <math> i = k-p, \dots, k</math>. For <math> r = 1, \dots, p </math> the following recursion is applied:
Line 102:
'''Works cited'''
*{{cite book | author = Carl de Boor | title = A Practical Guide to Splines, Revised Edition | publisher = Springer-Verlag | year =
[[Category:Numerical analysis]]
|