Name | Description | Type | Package | Framework |
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 |
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 |