Extension of the BSpline class to compute a least squares spline approximation to data points.
For a list of all members of this type, see BsLeastSquares Members.
System.Object
Imsl.Math.BSpline
Imsl.Math.BsLeastSquares
Public static (Shared in Visual Basic) members of this type are safe for multithreaded operations. Instance members are not guaranteed to be thread-safe.
Let's make the identifications
n = xData.length
x = xData
f = yData
m = nCoef
k = order
For convenience, we assume that the sequence x is increasing, although the class does not require this.
By default, k = 4, and the knot sequence we select equally distributes the knots through the distinct . In particular, the m + k knots will be generated in with k knots stacked at each of the extreme values. The interior knots will be equally spaced in the interval.
Once knots and weights w are determined, then the spline least-squares fit to the data is computed by minimizing over the linear coefficients
where the are a (B-spline) basis for the spline subspace.
This algorithm is based on the routine L2APPR by deBoor (1978, p. 255).
Namespace: Imsl.Math
Assembly: ImslCS (in ImslCS.dll)
BsLeastSquares Members | Imsl.Math Namespace | Example