Name | Description | Type | Package | Framework |
BicubicInterpolation | Bicubic interpolation is the two-dimensional equivalent of cubic Hermite spline interpolation. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BicubicInterpolation .PartialDerivatives | Specify the partial derivatives defined at points on a BivariateGrid. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BicubicSpline | Bicubic splines are the two-dimensional equivalent of cubic splines. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BilinearInterpolation | Bilinear interpolation is the 2-dimensional equivalent of linear interpolation. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BivariateArrayGrid | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu | |
BivariateGrid | A rectilinear (meaning that grid lines are not necessarily equally-spaced) bivariate grid of double values. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BivariateGridInterpolation | A bivariate interpolation, which requires the input to form a rectilinear grid. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
BivariateRegularGrid | A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
CubicHermite | Cubic Hermite spline interpolation is a piecewise spline interpolation, in which each polynomial is in Hermite form which consists of two control points and two control tangents. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
CubicHermite .Tangent | The method for computing the control tangent at a given index. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
CubicHermite .Tangents | Catmull-Rom splines are a special case of Cardinal splines and are defined as: (frac{partial y}{partial x})_k = frac{y_{k+1} - y_{k-1}}{x_{k+1} - x_{k-1}}. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
CubicSpline | The (natural) cubic spline interpolation fits a cubic polynomial between each pair of adjacent points such that adjacent cubics are continuous in their first and second derivative. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
DividedDifferences | Divided differences is recursive division process for calculating the coefficients in the interpolation polynomial in the Newton form. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
Interpolation | Interpolation is a method of constructing new data points within the range of a discrete set of known data points. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
LinearInterpolation | (Piecewise-)Linear interpolation fits a curve by interpolating linearly between two adjacent data-points. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
LinearInterpolator | Define a univariate function by linearly interpolating between adjacent points. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation | SuanShu |
MultiCubicSpline | algorithm works by recursively calling lower order cubic spline interpolation. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultiLinearInterpolation | by recursively calling lower order linear interpolation. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultivariateArrayGrid | MultiDimensionalCollection instance. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultivariateGrid | A multivariate rectilinear (not necessarily uniform) grid of double values. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultivariateGridInterpolation | Interpolation on a rectilinear multi-dimensional grid. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultivariateRegularGrid | A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
MultivariateRegularGrid .EquallySpacedVariable | Specify the positioning and spacing along one dimension. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |
NevilleTable | Neville's algorithm is a polynomial interpolation algorithm. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation | SuanShu |
NewtonPolynomial | Newton polynomial is the interpolation polynomial for a given set of data points in the Newton form. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.univariate | SuanShu |
OnlineInterpolator | An online interpolator allows dynamically adding more points for interpolation. | Interface | com.numericalmethod.suanshu.analysis.curvefit.interpolation | SuanShu |
PartialDerivativesByCenteredDifferencing | This implementation computes the partial derivatives by centered differencing. | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.bivariate | SuanShu |
RecursiveGridInterpolation | This algorithm works by recursively calling lower order interpolation (hence the cost is exponential), until the given univariate algorithm can be used when the remaining dimension | Class | com.numericalmethod.suanshu.analysis.curvefit.interpolation.multivariate | SuanShu |