Interpolation method: basic types and computational algorithms
A considerable number of mathematical problemsis connected with the finding of a distributed non-uniformly in the space of information. We are talking about information systems geographically, because it is in them that it is possible to measure the necessary quantities at certain points. To solve these problems, one or another method of interpolation is often used.
Interpolation is a method of calculatingintermediate values of values by the available discrete set of values. The most common methods of interpolation are: the method of inverse weighted distances, the surface of the trend and kriging.
Basic methods of interpolation
So, let's take a closer look at the first method, its essenceis due to the influence of points closer to the estimated compared to the one located further. When used, this method of interpolation involves selecting from a certain topography in a certain neighborhood a specific point that has the greatest impact on it. So you select the maximum search radius or the number of points that are located close to a certain point. Then the weight is given the height at each specific point, calculated depending on the distance from the given point. Only in this way can the greater contribution of the nearest points to the interpolated height be achieved by comparison with points farther from a given point.
Use of quadratic interpolation
There is another tool for determiningspecific points is the method of quadratic interpolation, the essence of which is the replacement of a function on a certain interval by a quadratic parabola. At the same time, its extremum is estimated analytically. After its approximate finding (minimum or maximum), it is necessary to specify a certain range of values, after which the search for the solution to continue. Repeating this procedure, it is possible, using an iterative procedure, to refine the value of this equation to the result with the accuracy specified in the statement of the problem.