Neville's Algorithm
Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point 
for 
, ..., 
, i.e., 
. A second
iteration is then performed in which 
and 
are combined
to fit through pairs of points, yielding 
, 
, .... The
procedure is repeated, generating a "pyramid" of approximations until the
final result is reached
 |
The final result is
 |
Contact the MathWorld Team
30 choose 18