There are several different notations for the single set of finite differences, described in the preceding Step. We introduce each of these three notations in terms of the so-called shift operator, which we will define first.
Let
be a set of
values of the function f(x) The shift operator E is defined by:
.
Consequently,
.
and so on, i.e.,
,
where k is any positive integer. Moreover, the last formula can be extended to negative integers, and indeed to all real values of j and k, so that, for example,
,
and
.
If we define the forward difference operator Q by
,
then
,
which is the first-order forward difference at xj. Similarly, we find that
![]()
is the second-order forward difference at xj, and so on. The forward difference of order k is
,
where k is any integer.
If we define the backward difference
operator
by
,
then
,
which is the first-order backward difference at xj. Similarly,
![]()
is the second-order backward difference at xj, etc. The backward difference of order k is
,
where k is any integer. Note
that
.
If we define the central difference operator
by
,
then
,
which is the first-order central difference at xj. Similarly,
![]()
is the second-order central difference at xj, etc. The central difference of order k is
,
where k is any integer. Note
that
.
The role of the forward, central, and backward differences is displayed by the difference table:

Although forward, central, and backward
differences represent
precisely the same data:
;
for x = 0(1)4. Use the
table to obtain the values of :