This package implements a variety of interpolation schemes for the Julia langauge. It has the goals of ease-of-use, broad algorithmic support, and exceptional performance.
This package is still relatively new. Currently its support is best for B-splines and also supports irregular grids. However, the API has been designed with intent to support more options. Pull-requests are more than welcome! It should be noted that the API may continue to evolve over time.
Other interpolation packages for Julia include:
Some of these packages support methods that
Interpolations does not,
so if you can't find what you need here, check one of them or submit a
pull request here.
At the bottom of this page, you can find a "performance shootout"
among these methods (as well as SciPy's
from the Julia REPL.
A, construct an "interpolation object"
itp = interpolate(A, options...)
options... (discussed below) controls the type of
interpolation you want to perform. This syntax assumes that the
A are equally-spaced.
To evaluate the interpolation at position
(x, y, ...), simply do
v = itp[x, y, ...]
Some interpolation objects support computation of the gradient, which can be obtained as
g = gradient(itp, x, y, ...)
or, if you're evaluating the gradient repeatedly, a somewhat more efficient option is
gradient!(g, itp, x, y, ...)
g is a pre-allocated vector.
Some interpolation objects support computation of the hessian, which can be obtained as
h = hessian(itp, x, y, ...)
or, if you're evaluating the hessian repeatedly, a somewhat more efficient option is
hessian!(h, itp, x, y, ...)
h is a pre-allocated matrix.
A may have any element type that supports the operations of addition
and multiplication. Examples include scalars like
Rational, but also multi-valued types like
RGB color vectors.
(x, y, ...) are n-tuples of numbers. Typically these will
be real-valued (not necessarily integer-valued), but can also be of types
such as DualNumbers if
you want to verify the computed value of gradients. You can also use
Julia's iterator objects, e.g.,
function ongrid!(dest, itp) for I in CartesianRange(size(itp)) dest[I] = itp[I] end end
would store the on-grid value at each grid point of
itp in the output
Finally, courtesy of Julia's indexing rules, you can also use
fine = itp[linspace(1,10,1001), linspace(1,15,201)]
Control of interpolation algorithm
The interpolation type is described in terms of degree, grid behavior and, if necessary, boundary conditions. There are currently three degrees available:
Cubic corresponding to B-splines of degree 0, 1, 2, and 3 respectively.
You also have to specify what grid representation you want. There are currently two choices:
OnGrid, in which the supplied data points are assumed to lie on the boundaries of the interpolation interval, and
OnCell in which the data points are assumed to lie on half-intervals between cell boundaries.
B-splines of quadratic or higher degree require solving an equation system to obtain the interpolation coefficients, and for that you must specify a boundary condition that is applied to close the system. The following boundary conditions are implemented:
Reflect; their mathematical implications are described in detail in the pdf document under
# Nearest-neighbor interpolation itp = interpolate(a, BSpline(Constant()), OnCell()) v = itp[5.4] # returns a # (Multi)linear interpolation itp = interpolate(A, BSpline(Linear()), OnGrid()) v = itp[3.2, 4.1] # returns 0.9*(0.8*A[3,4]+0.2*A[4,4]) + 0.1*(0.8*A[3,5]+0.2*A[4,5]) # Quadratic interpolation with reflecting boundary conditions # Quadratic is the lowest order that has continuous gradient itp = interpolate(A, BSpline(Quadratic(Reflect())), OnCell()) # Linear interpolation in the first dimension, and no interpolation (just lookup) in the second itp = interpolate(A, (BSpline(Linear()), NoInterp()), OnGrid()) v = itp[3.65, 5] # returns 0.35*A[3,5] + 0.65*A[4,5]
There are more options available, for example:
# In-place interpolation itp = interpolate!(A, BSpline(Quadratic(InPlace())), OnCell())
which destroys the input
A but also does not need to allocate as much memory.
These use a very similar syntax to BSplines, with the major exception
being that one does not get to choose the grid representation (they
OnGrid). As such one must specify a set of coordinate arrays
defining the knots of the array.
A = rand(20) A_x = collect(1.0:2.0:40.0) knots = (A_x,) itp = interpolate(knots, A, Gridded(Linear())) itp[2.0]
The spacing between adjacent samples need not be constant, you can use the syntax
itp = interpolate(knots, A, options...)
knots = (xknots, yknots, ...) to specify the positions along
each axis at which the array
A is sampled for arbitrary ("rectangular") samplings.
A = rand(8,20) knots = ([x^2 for x = 1:8], [0.2y for y = 1:20]) itp = interpolate(knots, A, Gridded(Linear())) itp[4,1.2] # approximately A[2,6]
One may also mix modes, by specifying a mode vector in the form of an explicit tuple:
itp = interpolate(knots, A, (Gridded(Linear()),Gridded(Constant())))
Presently there are only three modes for gridded:
whereby a linear interpolation is applied between knots,
whereby nearest neighbor interpolation is used on the applied axis,
whereby the coordinate of the selected input vector MUST be located on a grid point. Requests for off grid coordinates results in the throwing of an error.
The call to
extrapolate defines what happens if you try to index into the interpolation object with coordinates outside of
[1, size(data,d)] in any dimension
d. The implemented boundary conditions are
Reflect, with more options planned.
Reflect require that there is a method of
Base.mod that can handle the indices used.
perf directory, you can find a script that tests
interpolation with several different packages. We consider
interpolation in 1, 2, 3, and 4 dimensions, with orders 0
Constant), 1 (
Linear), and 2 (
Quadratic). Methods include
methods from the Grid.jl
package, methods from the
Dierckx.jl package, methods
GI), methods from the
ApproXD.jl package, and
methods from SciPy's
RegularGridInterpolator accessed via
Py). All methods
are tested using an
Array with approximately
10^6 elements, and
the interpolation task is simply to visit each grid point.
First, let's look at the two B-spline algorithms,
Grid. Here's a plot of the "construction time," the amount of time
it takes to initialize an interpolation object (smaller is better):
The construction time is negligible until you get to second order (quadratic); that's because quadratic is the lowest order requiring the solution of tridiagonal systems upon construction. The solvers used by Interpolations are much faster than the approach taken in Grid.
Now let's examine the interpolation performance. Here we'll measure "throughput", the number of interpolations performed per second (larger is better):
Once again, Interpolations wins on every test, by a factor that ranges from 7 to 13.
Now let's look at the "gridded" methods that allow irregular spacing
along each axis. For some of these, we compare interpolation performance in
both "vectorized" form
itp[xvector, yvector] and in "scalar" form
for y in yvector, x in xvector; val = itp[x,y]; end.
First, construction time (smaller is better):
Missing dots indicate cases that were not tested, or not supported by the package. (For construction, differences between "vec" and "scalar" are just noise, since no interpolation is performed during construction.) The only package that takes appreciable construction time is Dierckx.
And here's "throughput" (larger is better). To ensure we can see the wide range of scales, here we use "square-root" scaling of the y-axis:
For 1d, the "Dierckx scalar" and "GI" tests were interrupted because they ran more than 20 seconds (far longer than any other test). Both performed much better in 2d, interestingly. You can see that Interpolations wins in every case, sometimes by a very large margin.
Work is very much in progress, but and help is always welcome. If you want to help out but don't know where to start, take a look at issue #5 - our feature wishlist =) There is also some developer documentation that may help you understand how things work internally.
Contributions in any form are appreciated, but the best pull requests come with tests!