De Boor's algorithm: Difference between revisions

Revision as of 04:35, 4 March 2009

Revision as of 20:27, 3 May 2009

Line 27:

== The algorithm ==

Suppose <math> x \in [u_{\ell},u_{\ell+1}] </math> and <math> \mathbf{d}_i^{[0]} = \mathbf{d}_i </math> for ''<math>i = l\ell-n, ...\dots, l''\ell</math>.

Now calculate

:<math> \mathbf{d}_i^{[k]} = (1-\alpha_{k,i}) \mathbf{d}_{i-1}^{[k-1]} + \alpha_{k,i} \mathbf{d}_i^{[k-1]}; \qquad k=1,\dots,n; \quad i=\ell-n+k,\dots,\ell </math>