Elena & Fabrice's Web

This wikilog article is a draft, it was not published yet.

m (Replaced content with " http://tutorial.math.lamar.edu/Classes/DE/Bernoulli.aspx http://calculuslab.deltacollege.edu/ODE/7-C-3/7-C-3-h.html Backward Euler method, or Implicit Euler method,") |
m |
||

Line 1: | Line 1: | ||

+ | We could now study still other methods, such as the Backward Euler method, or Implicit Euler method. But we will instead turn to other numerical problems, namely, interpolation and extrapolation. | ||

+ | Interpolation describes the general problem of providing the value of a function which is known only for a few points, at any point which lies between other known points (if the unknown point is not "surrounded" by known points, then the problem becomes that of "extrapolation"). | ||

− | + | The simplest and also most natural method of interpolation. It has been used since immemorial times throughout history and remains a basic technique in the computer industry, which even formed a special name for it, "lerp" (also used as a verb). | |

− | + | The method simply consists in finding the equation for a line between two points, those which are known from the data, i.e., | |

− | + | $$L(x)=f(a)+{f(b)-f(a)\over b-a}(x-a)$$ | |

+ | |||

+ | Let us assume that in the parametrization of our problem, the range of the function is the number of equally-spaced data points known and we wish to interpolate to real-valued functions. All variations of lerp will do something similar. We can then refer to the known data points $a$ and $b$ from $x$ as: | ||

+ | |||

+ | $$ | ||

+ | \begin{align} | ||

+ | a&=\lfloor x\rfloor x\\ | ||

+ | b&=\lceil x\rceil | ||

+ | \end{align} | ||

+ | $$ | ||

+ | |||

+ | In two dimensions, linear interpolation becomes bilinear interpolations (in 3D, trilinear, etc.) | ||

+ | |||

+ | Polynomial interpolation. | ||

+ | |||

+ | Spline interpolation. | ||

+ | |||

+ | Runge's phenomenon. |

We could now study still other methods, such as the Backward Euler method, or Implicit Euler method. But we will instead turn to other numerical problems, namely, interpolation and extrapolation.

Interpolation describes the general problem of providing the value of a function which is known only for a few points, at any point which lies between other known points (if the unknown point is not "surrounded" by known points, then the problem becomes that of "extrapolation").

The simplest and also most natural method of interpolation. It has been used since immemorial times throughout history and remains a basic technique in the computer industry, which even formed a special name for it, "lerp" (also used as a verb).

The method simply consists in finding the equation for a line between two points, those which are known from the data, i.e.,

$$L(x)=f(a)+{f(b)-f(a)\over b-a}(x-a)$$

Let us assume that in the parametrization of our problem, the range of the function is the number of equally-spaced data points known and we wish to interpolate to real-valued functions. All variations of lerp will do something similar. We can then refer to the known data points $a$ and $b$ from $x$ as:

$$ \begin{align} a&=\lfloor x\rfloor x\\ b&=\lceil x\rceil \end{align} $$

In two dimensions, linear interpolation becomes bilinear interpolations (in 3D, trilinear, etc.)

Polynomial interpolation.

Spline interpolation.

Runge's phenomenon.