Breakpoints.
Coefficients of the polynomials. They are reshaped to a 3-D array with the last dimension representing the trailing dimensions of the original coefficient array.
Interpolation axis.
The polynomial between x[i]
and x[i + 1]
is written in the local power basis:
S = sum(c[m, i] * (xp - x[i])**(k-m) for m in range(k+1))
where k
is the degree of the polynomial.
High-order polynomials in the power basis can be numerically unstable. Precision problems can start to appear for orders larger than 20-30.
Polynomial coefficients, order :None:None:`k` and m intervals.
Polynomial breakpoints. Must be sorted in either increasing or decreasing order.
If bool, determines whether to extrapolate to out-of-bounds points based on first and last intervals, or to return NaNs. If 'periodic', periodic extrapolation is used. Default is True.
Interpolation axis. Default is zero.
Piecewise polynomial in terms of coefficients and breakpoints
BPoly
piecewise polynomials in the Bernstein basis
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.integrate._bvp.solve_bvp
scipy.interpolate._interpolate.NdPPoly
scipy.interpolate._interpolate._ppform
scipy.interpolate._interpolate.PPoly.solve
scipy.interpolate._cubic.CubicSpline
scipy.interpolate._cubic.CubicHermiteSpline
scipy.interpolate._interpolate.BPoly
scipy.interpolate._cubic.Akima1DInterpolator
scipy.interpolate._cubic.PchipInterpolator
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