Fraser diagram

A method for obtaining interpolation formulas with respect to the nodes $x _ {0} , x _ {0} \pm h, x _ {0} \pm 2h \dots$ at the point $x = x _ {0} + th$, based on the relations

$$C _ {p} ^ {q} f _ {r} ^ { q } + C _ {p + 1 } ^ {q + 1 } f _ {r + 1/2 } ^ { q + 1 } = \ C _ {p} ^ {q} f _ {r + 1 } ^ { q } + C _ {p} ^ {q + 1 } f _ {r + 1/2 } ^ { q + 1 } =$$

$$= \ C _ {p} ^ {q} f _ {r + 1/2 } ^ { q } + { \frac{1}{2} } ( C _ {p + 1 } ^ {q + 1 } + C _ {p} ^ {q + 1 } ) f _ {r + 1/2 } ^ { q + 1 } ,$$

where $f _ {l} ^ { k }$ are the finite differences of the function $f ( x)$ and $C _ {p} ^ {q}$ are the binomial coefficients. For each path going from an arbitrary element of the left-hand column along the sides or horizontal diagonals of the rhombi in the Fraser diagram there is some corresponding interpolation formula. To obtain it one must follow the following rules.

$$\begin{array}{cccccc} f _ {-} 4 &{} &{} C _ {t+} 4 ^ {2} \} f _ {- 4 } ^ { 2 } &{} &{} C _ {t+} 5 ^ {4} \} f _ {- 4 } ^ { 4 } &{} \\ {} &\left . \begin{array}{c} C _ {t+} 4 ^ {1} \\ C _ {t+} 3 ^ {1} \end{array} \right \} f _ {- 7/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t+} 5 ^ {3} \\ C _ {t+} 4 ^ {3} \end{array} \right \} f _ {- 7/2 } ^ { 3 } &{} &\left . \begin{array}{c} C _ {t+} 6 ^ {5} \\ C _ {t+} 5 ^ {5} \end{array} \right \} f _ {- 7/2 } ^ { 5 } \\ f _ {-} 3 &{} &\left . \begin{array}{c} C _ {t+} 4 ^ {2} \\ C _ {t+} 3 ^ {2} \end{array} \right \} f _ {- 3 } ^ { 2 } &{} &\left . \begin{array}{c} C _ {t+} 5 ^ {4} \\ C _ {t+} 4 ^ {4} \end{array} \right \} f _ {- 3 } ^ { 4 } &{} \\ \end{array}$$

$$\begin{array}{cccccc} {} &\left . \begin{array}{c} C _ {t+} 3 ^ {1} \\ C _ {t+} 2 ^ {1} \end{array} \right \} f _ {- 5/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t+} 4 ^ {3} \\ C _ {t+} 3 ^ {3} \end{array} \right \} f _ {- 5/2 } ^ { 3 } &{} &\left . \begin{array}{c} C _ {t+} 5 ^ {5} \\ C _ {t+} 4 ^ {5} \end{array} \right \} f _ {- 5/2 } ^ { 5 } \\ f _ {-} 2 &{} &\left {} \begin{array}{c} C _ {t+} 3 ^ {2} \\ C _ {t+} 2 ^ {2} \end{array} \right \} f _ {-} 2 ^ { 2 } &{} &\left . \begin{array}{c} C _ {t+} 4 ^ {4} \\ C _ {t+} 3 ^ {4} \end{array} \right \} f _ {- 2 } ^ { 4 } &{} \\ {} &\left . \begin{array}{c} C _ {t+} 2 ^ {1} \\ C _ {t+} 1 ^ {1} \end{array} \right \} f _ {- 3/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t+} 3 ^ {3} \\ C _ {t+} 2 ^ {3} \end{array} \right \} f _ {- 3/2 } ^ { 3 } &{} &\left {} \begin{array}{c} C _ {t+} 4 ^ {5} \\ C _ {t+} 3 ^ {5} \end{array} \right \} f _ {- 3/2 } ^ { 5 } \\ \end{array}$$

$$\begin{array}{cccccc} f _ {-} 1 &{} &\left . \begin{array}{c} C _ {t+} 2 ^ {2} \\ C _ {t+} 1 ^ {2} \end{array} \right \} f _ {- 1 } ^ { 2 } &{} &\left . \begin{array}{c} C _ {t+} 3 ^ {4} \\ C _ {t+} 2 ^ {4} \end{array} \right \} f _ {- 1 } ^ { 4 } &{} \\ {} &\left . \begin{array}{c} C _ {t+} 1 ^ {1} \\ C _ {t} ^ {1} \end{array} \right \} f _ {- 1/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t+} 2 ^ {3} \\ C _ {t+} 1 ^ {3} \end{array} \right \} f _ {- 1/2 } ^ { 3 } &{} &\left . \begin{array}{c} C _ {t+} 3 ^ {5} \\ C _ {t+} 2 ^ {5} \end{array} \right \} f _ {- 1/2 } ^ { 5 } \\ f _ {0} &{} &\left . \begin{array}{c} C _ {t+} 1 ^ {2} \\ C _ {t} ^ {2} \end{array} \right \} f _ {0 } ^ { 2 } &{} &\left . \begin{array}{c} C _ {t+} 2 ^ {4} \\ C _ {t+} 1 ^ {4} \end{array} \right \} f _ {0 } ^ { 4 } &{} \\ \end{array}$$

$$\begin{array}{cccccc} {} &\left . \begin{array}{c} C _ {t} ^ {1} \\ C _ {t-} 1 ^ {1} \end{array} \right \} f _ {1/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t+} 1 ^ {3} \\ C _ {t} ^ {3} \end{array} \right \} f _ {1/2 } ^ { 3 } &{} &\left . \begin{array}{c} C _ {t+} 2 ^ {5} \\ C _ {t+} 1 ^ {5} \end{array} \right \} f _ {1/2 } ^ { 5 } \\ f _ {1} &{} &\left . \begin{array}{c} C _ {t} ^ {2} \\ C _ {t-} 1 ^ {2} \end{array} \right \} f _ {1 } ^ { 2 } &{} &\left . \begin{array}{c} C _ {t+} 1 ^ {4} \\ C _ {t} ^ {4} \end{array} \right \} f _ {1 } ^ { 4 } &{} \\ {} &\left . \begin{array}{c} C _ {t-} 1 ^ {1} \\ C _ {t-} 2 ^ {1} \end{array} \right \} f _ {3/2 } ^ { 1 } &{} &\left . \begin{array}{c} C _ {t} ^ {3} \\ C _ {t-} 1 ^ {3} \end{array} \right \} f _ {3/2 } ^ { 3 } &{} &\left . \begin{array}{c} C _ {t+} 1 ^ {5} \\ C _ {t} ^ {5} \end{array} \right \} f _ {3/2 } ^ { 5 } \\ f _ {2} &{} &{} {C _ {t-} 1 ^ {2} } \} f _ {2 } ^ { 2 } &{} &{} C _ {t} ^ {4} \} f _ {2} ^ { 4 } &{} \\ \end{array}$$

1) When a column of differences is intersected from the left to the right, one term is added.

2) If the path comes in (from the left) to some column of differences along a side of a rhombus, then the added term is equal to the product of the difference at the intersection of the path and the column by the coefficient associated with the side of the rhombus that has been traversed.

3) If the path comes in (from the left) to some column of differences along a horizontal diagonal of a rhombus, then the added term is equal to the product of the difference at the intersection of the path and the column by the half-sum of the coefficients associated with the sides that come in (from the left) to the same vertex of the rhombus.

4) If the path intersects the column of differences (from the left to the right) along a horizontal diagonal of a rhombus between two differences, then one adds the product of the half-sum of these differences by the coefficient associated with the side of the rhombus immediately above (or below) the section of the diagonal that has been traversed.

5) Each part of a path that goes from the right to the left gives rise to the same terms as for going from the left to the right, but with the opposite sign.

6) One can deal with the column of tabular values of the function as the column of differences of order zero, by the same rules as with the other columns of differences.

References

 [1] I.S. Berezin, N.P. Zhidkov, "Computing methods" , 1 , Pergamon (1973) (Translated from Russian) [2] G.A. Korn, T.M. Korn, "Mathematical handbook for scientists and engineers" , McGraw-Hill (1968)