splprep(x, w=None, u=None, ub=None, ue=None, k=3, task=0, s=None, t=None, full_output=0, nest=None, per=0, quiet=1)
Given a list of N rank-1 arrays, x, which represent a curve in N-dimensional space parametrized by u, find a smooth approximating spline curve g(u). Uses the FORTRAN routine parcur from FITPACK.
See splev
for evaluation of the spline and its derivatives. The number of dimensions N must be smaller than 11.
A list of sample vector arrays representing the curve.
Strictly positive rank-1 array of weights the same length as :None:None:`x[0]`. The weights are used in computing the weighted least-squares spline fit. If the errors in the x values have standard-deviation given by the vector d, then w should be 1/d. Default is ones(len(x[0]))
.
An array of parameter values. If not given, these values are calculated automatically as M = len(x[0])
, where
v[0] = 0
v[i] = v[i-1] + distance(
:None:None:`x[i]`,:None:None:`x[i-1]`)u[i] = v[i] / v[M-1]
The end-points of the parameters interval. Defaults to u[0] and u[-1].
Degree of the spline. Cubic splines are recommended. Even values of k should be avoided especially with a small s-value. 1 <= k <= 5
, default is 3.
If task==0 (default), find t and c for a given smoothing factor, s. If task==1, find t and c for another value of the smoothing factor, s. There must have been a previous call with task=0 or task=1 for the same set of data. If task=-1 find the weighted least square spline for a given set of knots, t.
A smoothing condition. The amount of smoothness is determined by satisfying the conditions: sum((w * (y - g))**2,axis=0) <= s
, where g(x) is the smoothed interpolation of (x,y). The user can use s to control the trade-off between closeness and smoothness of fit. Larger s means more smoothing while smaller values of s indicate less smoothing. Recommended values of s depend on the weights, w. If the weights represent the inverse of the standard-deviation of y, then a good s value should be found in the range (m-sqrt(2*m),m+sqrt(2*m))
, where m is the number of data points in x, y, and w.
The knots needed for task=-1.
If non-zero, then return optional outputs.
An over-estimate of the total number of knots of the spline to help in determining the storage space. By default nest=m/2. Always large enough is nest=m+k+1.
If non-zero, data points are considered periodic with period x[m-1] - x[0]
and a smooth periodic spline approximation is returned. Values of y[m-1]
and w[m-1]
are not used.
Non-zero to suppress messages. This parameter is deprecated; use standard Python warning filters instead.
A tuple (t,c,k) containing the vector of knots, the B-spline coefficients, and the degree of the spline.
An array of the values of the parameter.
The weighted sum of squared residuals of the spline approximation.
An integer flag about splrep success. Success is indicated if ier<=0. If ier in [1,2,3] an error occurred but was not raised. Otherwise an error is raised.
A message corresponding to the integer flag, ier.
Find the B-spline representation of an N-D curve.
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.interpolate._fitpack_impl.splint
scipy.interpolate._fitpack_impl.splrep
scipy.interpolate._fitpack_py.splrep
scipy.interpolate._fitpack_impl.sproot
scipy.interpolate._fitpack_py.splev
scipy.interpolate._fitpack_py.sproot
scipy.interpolate._fitpack_impl.splev
scipy.interpolate._fitpack_py.splint
scipy.interpolate._fitpack_impl.bisplrep
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them