Linear interpolation

The linear interpolation is certainly the simplest method of interpolation. For example, if we wish to determine F (2,5) whereas one knows the values of F (2) = 0,9093 and F (3) = 0,1411, this method consists in taking the average of the 2 values knowing that 2,5 is the medium of the 2 points. One obtains consequently f (2,5) = \ frac {0,9093+0,1411} {2} =0,5252.

More generally, the linear interpolation between 2 points ( X has , has there) and ( X B , there B ), the line of interpolation will have as an equation (three equivalent formulations):

F (X) = \ frac {y_a there _b} {x_a-x_b} X + \ frac {x_a.y_b-x_b.y_a} {x_a-x_b}

or (formula of Taylor-Young to the first order):

F (X) = y_a + (x-x_a) \ frac {y_b there _a} {x_b-x_a}

or:

F (X) = \ frac {x_b-x} {x_b-x_a} y_a + \ frac {x-x_a} {x_b-x_a} y_b

This last formula corresponds to the weighted average.

This method is fast and easy but it misses precision. Another disadvantage is that the function is not derivable at the point X K .

The error in estimation shows that the linear interpolation is not very precise. If the function G which one wishes to interpolate is twice continuement derivable and if x \ in then the interpolation error is given by:

|F (X) - G (X)| \ C (x_b-x_a) ^2 \ quad where \ quad C = \ frac18 \ max_ {there \ in} |G (there)|.

In other words, the error is proportional to the square of the distance between the nodes. Other methods of interpolation make it possible to obtain smoother functions of interpolation, for example, the polynomial Interpolation.

The linear interpolation can be used to provide a numerical method of calculating of integrals: the Method of the trapezoids.

Random links:Soyuz 27 | Integrating the Healthcare Enterprise | Make-up | Ascaris of the dog | Hjalmar Branting | Camp_de_Faraday