The polynomial passes through all the pairs (xi,yi). One may additionally specify a number of derivatives at each point xi; this is done by repeating the value xi and specifying the derivatives as successive yi values.
Allows evaluation of the polynomial and all its derivatives. For reasons of numerical stability, this function does not compute the coefficients of the polynomial, although they can be obtained by evaluating all the derivatives.
Be aware that the algorithms implemented here are not necessarily the most numerically stable known. Moreover, even in a world of exact computation, unless the x coordinates are chosen very carefully - Chebyshev zeros (e.g., cos(i*pi/n)) are a good choice - polynomial interpolation itself is a very ill-conditioned process due to the Runge phenomenon. In general, even with well-chosen x values, degrees higher than about thirty cause problems with numerical instability in this code.
Based on .
Known x-coordinates. Must be sorted in increasing order.
Known y-coordinates. When an xi occurs two or more times in a row, the corresponding yi's represent derivative values.
Axis in the yi array corresponding to the x-coordinate values.
Interpolating polynomial for a set of points.
To produce a polynomial that is zero at 0 and 1 and has derivative 2 at 0, call
>>> from scipy.interpolate import KroghInterpolator
... KroghInterpolator([0,0,1],[0,2,0])
This constructs the quadratic 2*X**2-2*X. The derivative condition is indicated by the repeated zero in the xi array; the corresponding yi values are 0, the function value, and 2, the derivative value.
For another example, given xi, yi, and a derivative ypi for each point, appropriate arrays can be constructed as:
>>> rng = np.random.default_rng()
... xi = np.linspace(0, 1, 5)
... yi, ypi = rng.random((2, 5))
... xi_k, yi_k = np.repeat(xi, 2), np.ravel(np.dstack((yi,ypi)))
... KroghInterpolator(xi_k, yi_k)
To produce a vector-valued polynomial, supply a higher-dimensional array for yi:
>>> KroghInterpolator([0,1],[[2,3],[4,5]])
This constructs a linear polynomial giving (2,3) at 0 and (4,5) at 1.
See :The following pages refer to to this document either explicitly or contain code examples using this.
scipy.interpolate._polyint._Interpolator1DWithDerivatives.derivatives
scipy.interpolate._polyint.krogh_interpolate
scipy.interpolate._polyint.KroghInterpolator
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