1d, 2d interpolation functions.
See more:
Note: Smile interpolators doesn't check ranges.
You provide data as sequence or double array.
You provide two sequences:
xs
- x axis coorditanes, strictly monotonic (increasing)ys
- function valuesSee [[kriging-spline-interpolator]]
This is grid based interpolation.
xs
- x axis coordinates, strictly monotonic (increasing)ys
- y axis coordinates, strictly monotonic (increasing)vs
- sequence of sequences of values (2d array) for all possible pairs. Array is column-wise: [ [first column] [second column] ...]
.See [[cubic-2d-interpolator]]
1d, 2d interpolation functions. See more: * [Apache Commons Math](http://commons.apache.org/proper/commons-math/javadocs/api-3.6.1/org/apache/commons/math3/analysis/interpolation/package-summary.html) * [Smile Interpolation](http://haifengl.github.io/smile/api/java/smile/interpolation/package-summary.html) Note: Smile interpolators doesn't check ranges. ### Input data You provide data as sequence or double array. #### 1d interpolation You provide two sequences: * `xs` - x axis coorditanes, strictly monotonic (increasing) * `ys` - function values See [[kriging-spline-interpolator]] #### 2d interpolation This is grid based interpolation. * `xs` - x axis coordinates, strictly monotonic (increasing) * `ys` - y axis coordinates, strictly monotonic (increasing) * `vs` - sequence of sequences of values (2d array) for all possible pairs. Array is column-wise: `[ [first column] [second column] ...]`. See [[cubic-2d-interpolator]]
(akima-spline xs ys)
Create cubic spline interpolator using Akima algorithm. Minimum number of points: 5
xs[n] < xs[n+1] for all n.
Source: Apache Commons Math.
Create cubic spline interpolator using Akima algorithm. Minimum number of points: 5 xs[n] < xs[n+1] for all n. Source: Apache Commons Math.
(bicubic xs ys vs)
Bicubic 2d.
Grid based.
Source: Apache Commons Math.
Bicubic 2d. Grid based. Source: Apache Commons Math.
(bicubic-smile xs ys vs)
Bicubic 2d.
Grid based.
Source: Smile.
Bicubic 2d. Grid based. Source: Smile.
(bilinear xs ys vs)
Bilinear 2d.
Grid based.
Source: Smile.
Bilinear 2d. Grid based. Source: Smile.
(cubic-2d xs ys vs)
Cubic spline 2d.
Grid based.
Source: Smile.
Cubic spline 2d. Grid based. Source: Smile.
(cubic-spline xs ys)
Cubic spline interpolation.
Source: Smile.
Cubic spline interpolation. Source: Smile.
(divided-difference xs ys)
Create Divided Difference Algorithm for interpolation.
Source: Apache Commons Math.
Create Divided Difference Algorithm for interpolation. Source: Apache Commons Math.
Map of 1d interpolation functions
Map of 1d interpolation functions
Map of 2d interpolation functions
Map of 2d interpolation functions
(kriging-spline xs ys)
Kriging interpolation.
Source: Smile.
Kriging interpolation. Source: Smile.
(linear xs ys)
Create Divided Difference Algorithm for inqterpolation.
Source: Apache Commons Math.
Create Divided Difference Algorithm for inqterpolation. Source: Apache Commons Math.
(linear-smile xs ys)
Linear interpolation from Smile library.
Source: Smile.
Linear interpolation from Smile library. Source: Smile.
(loess xs ys)
(loess bandwidth robustness-iters xs ys)
(loess bandwidth robustness-iters accuracy xs ys)
Local Regression Algorithm
Source: Apache Commons Math.
Local Regression Algorithm * bandwidth: 0.2-1.0 (optimal: 0.25-0.5, default: 0.4) * robustness-iters: 0-4 (optimal: 0, default: 2) * accuracy: double (default: 1e-12) Source: Apache Commons Math.
(microsphere-2d-projection elements
max-dark-friction
dark-threshold
background
exponent
shared-sphere?
no-interpolation-tolerance
xs
ys
vs)
Microsphere projection interpolator - 2d version
Grid based.
Source: Apache Commons Math.
Microsphere projection interpolator - 2d version Grid based. Source: Apache Commons Math.
(microsphere-projection elements
max-dark-friction
dark-threshold
background
exponent
shared-sphere?
no-interpolation-tolerance
xs
ys)
Microsphere projection interpolator - 1d version
Source: Apache Commons Math.
Microsphere projection interpolator - 1d version Source: Apache Commons Math.
(neville xs ys)
Neville algorithm
Source: Apache Commons Math.
Neville algorithm Source: Apache Commons Math.
(piecewise-bicubic xs ys vs)
Piecewise bicubic 2d.
Grid based.
Source: Apache Commons Math.
Piecewise bicubic 2d. Grid based. Source: Apache Commons Math.
(rbf rbf-fn xs ys)
(rbf rbf-fn normalize? xs ys)
RBF (Radial Basis Function) interpolation.
Source: Smile
RBF (Radial Basis Function) interpolation. Source: Smile
(shepard xs ys)
(shepard p xs ys)
Shepard interpolation.
Source: Smile.
Shepard interpolation. Source: Smile.
(spline xs ys)
Cubic spline interpolation
Source: Apache Commons Math.
Cubic spline interpolation Source: Apache Commons Math.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close