Neville's Algorithm
An interpolation Algorithm which proceeds by first fitting a Polynomial 
of degree 0 through the points
for 
..., 
, i.e., 
. A second iteration is then performed in which 
is fit throughpairs of points, yielding , 
, .... The procedure is repeated, generating a ``pyramid'' of approximationsuntil the final result is reached
The final result is
See also Bulirsch-Stoer Algorithm
- de Moivre Number
- de Moivre's Identity
- de Moivre's Quintic
- de Morgan's and Bertrand's Test
- de Morgan's Duality Law
- de Morgan's Laws
- Dendrite Fractal
- Denjoy Integral
- Denominator
- Dense
- Density
- Density (Polygon)
- Density (Sequence)
- Denumerable Set
- Denumerably Infinite
- de Polignac's Conjecture
- Depth (Graph)
- Depth (Size)
- Depth (Statistics)
- Depth (Tree)
- Derangement
- de Rham Cohomology
- Derivative
- Derivative Test
- Derived Set