De Boor's algorithm: Difference between revisions

Content deleted Content added
Pomax (talk | contribs)
The algorithm: there is no room for "suppose" in a mathematical algorithm unless it's a reductio ad absurbum
Line 29:
== The algorithm ==
 
SupposeGiven some <math> x \in [u_{\ell},u_{\ell+1}) </math> and <math> \mathbf{d}_i^{[0]} = \mathbf{d}_i </math> for <math>i = \ell-n, \dots, \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>