Multivariate interpolation

Top

Home > Library > Miscellaneous > Wikipedia

In numerical analysis, multivariate interpolation or spatial interpolation is interpolation on functions of more than one variable.

The function to be interpolated is known at given points $(x_i, y_i, z_i, \dots)$ and the interpolation problem consist of yielding values at arbitrary points $(x,y,z,\dots)$ .

Contents

1 Regular grid
2 Irregular grid (scattered data)
3 Notes
4 External links

Regular grid

For function values known on a regular grid (having predetermined, not necessarily uniform, spacing), the following methods are available.

Any dimension

Nearest-neighbor interpolation

2 dimensions

Bitmap resampling is the application of 2D multivariate interpolation in image processing.

Three of the methods applied on the same dataset, from 16 values located at the black dots. The colours represent the interpolated values.

Nearest neighbor
Bilinear
Bicubic

See also Padua points, for polynomial interpolation in two variables.

3 dimensions

Tensor product splines for N dimensions

Catmull-Rom splines can be easily generalized to any number of dimensions. The cubic Hermite spline article will remind you that $\mathrm{CINT}_x(f_{-1}, f_0, f_1, f_2) = \mathbf{b}(x) \cdot \left( f_{-1} f_0 f_1 f_2 \right)$ for some 4-vector $\mathbf{b}(x)$ which is a function of x alone, where $f j$ is the value at $j$ of the function to be interpolated. Rewrite this approximation as

$\mathrm{CR}(x) = \sum_{i=-1}^2 f_i b_i(x)$

This formula can be directly generalized to N dimensions ^[1]:

$\mathrm{CR}(x_1,\dots,x_N) = \sum_{i_1,\dots,i_N=-1}^2 f_{i_1\dots i_N} \prod_{j=1}^N b_{i_j}(x_j)$

Note that similar generalizations can be made for other types of spline interpolations, including Hermite splines. In regards to efficiency, the general formula can in fact be computed as a composition of successive $CINT$ -type operations for any type of tensor product splines, as explained in the tricubic interpolation article. However, the fact remains that if there are $n$ terms in the 1-dimensional $CR$ -like summation, then there will be $n N$ terms in the $N$ -dimensional summation.

Irregular grid (scattered data)

Schemes defined for scattered data on a irregular grid should all work on a regular grid, typically reducing to another known method.

Nearest-neighbor interpolation
Triangulated irregular network-based natural neighbor
Triangulated irregular network-based linear interpolation (a type of piecewise linear function)
Inverse distance weighting
Kriging
Radial basis function
Thin plate spline
Polyharmonic spline (the thin-plate-spline is a special case of a polyharmonic spline)
Least-squares spline

Notes

^ Two hierarchies of spline interpolations. Practical algorithms for multivariate higher order splines

External links

‹The stub template below has been proposed for renaming to applied-math-stub. See stub types for deletion to help reach a consensus on what to do.
Feel free to edit the template, but the template must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, read the guide to deletion.›

This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

Help us answer these

What is the interpolation for pi?

What is interpolation and extrapolation?

What is interpolation extrapolation?

Where is interpolation applicable?

Post a question - any question - to the WikiAnswers community:

Copyrights:

Cite

Wikipedia on Answers.com This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article Multivariate interpolation. Read