De Boor's algorithm: Difference between revisions

Revision as of 22:07, 7 August 2016

Revision as of 11:43, 10 October 2016

Line 29:

== The algorithm ==

We can compute the above <math>\mathbf{s}(x)</math> by defining some <math> x \in [u_{\ell},u_{\ell+1})] </math>, setting <math> \mathbf{d}_i^{[0]} = \mathbf{N}^0_i(x)</math> for <math>i = \ell-n, \dots, \ell</math>, and with these, computing:

:<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>