| Server IP : 35.80.110.71 / Your IP : 216.73.216.221 Web Server : Apache/2.4.58 (Ubuntu) System : Linux ip-172-31-21-44 6.17.0-1019-aws #19~24.04.1-Ubuntu SMP Tue Jun 23 18:53:06 UTC 2026 x86_64 User : ubuntu ( 1000) PHP Version : 8.3.31 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /lib/python3/dist-packages/scipy/interpolate/__pycache__/ |
Upload File : |
�
x�f_g � � � d dl Z d dlZd dlmZ d dlmZmZ g d�Zd� Z G d� d� Z
G d� d e
� Z G d
� d e � Z dd �Z
dd
�Z G d� de
� Zdd�Zy)� N)� factorial)�_asarray_validated�float_factorial)�KroghInterpolator�krogh_interpolate�BarycentricInterpolator�barycentric_interpolate� approximate_taylor_polynomialc �j � t j | � xs t | d� xr | j dk( S )z-Check whether x is if a scalar type, or 0-dim�shape� )�np�isscalar�hasattrr )�xs �</usr/lib/python3/dist-packages/scipy/interpolate/_polyint.py� _isscalarr s) � �
�;�;�q�>� B�W�Q�� 0� B�Q�W�W��]�B� c �L � e Zd ZdZdZd d�Zd� Zd� Zd� Zd� Z d
d �Z
dd
�Z d
d �Z y)�_Interpolator1Da
Common features in univariate interpolation
Deal with input data type and interpolation axis rolling. The
actual interpolator can assume the y-data is of shape (n, r) where
`n` is the number of x-points, and `r` the number of variables,
and use self.dtype as the y-data type.
Attributes
----------
_y_axis
Axis along which the interpolation goes in the original array
_y_extra_shape
Additional trailing shape of the input arrays, excluding
the interpolation axis.
dtype
Dtype of the y-data arrays. Can be set via _set_dtype, which
forces it to be float or complex.
Methods
-------
__call__
_prepare_x
_finish_y
_reshape_yi
_set_yi
_set_dtype
_evaluate
)�_y_axis�_y_extra_shape�dtypeNc �\ � || _ d | _ d | _ |�| j |||�� y y )N��xi�axis)r r r �_set_yi)�selfr �yir s r �__init__z_Interpolator1D.__init__3 s4 � ��� � "�����
�
�>� �L�L����L� .� r c �p � | j |� \ }}| j |� }| j ||� S )a�
Evaluate the interpolant
Parameters
----------
x : array_like
Points to evaluate the interpolant at.
Returns
-------
y : array_like
Interpolated values. Shape is determined by replacing
the interpolation axis in the original array with the shape of x.
Notes
-----
Input values `x` must be convertible to `float` values like `int`
or `float`.
)�
_prepare_x� _evaluate� _finish_y)r r �x_shape�ys r �__call__z_Interpolator1D.__call__: s5 � �* �_�_�Q�'�
��7� �N�N�1� ���~�~�a��)�)r c � � t � �)zB
Actually evaluate the value of the interpolator.
)�NotImplementedError�r r s r r$ z_Interpolator1D._evaluateS s
� � "�#�#r c �Z � t |dd�� }|j }|j � |fS )z Reshape input x array to 1-DFT)� check_finite�
as_inexact)r r �ravel)r r r& s r r# z_Interpolator1D._prepare_xY s* � � �q�u�� F���'�'���w�w�y�'�!�!r c � � |j || j z � }| j dk7 r�|dk7 r�t |� }t | j � }t t ||| j z � � t t |� � z t t || j z ||z � � z }|j
|� }|S )z@Reshape interpolated y back to an N-D array similar to initial yr r
)�reshaper r �len�list�range� transpose)r r' r& �nx�ny�ss r r% z_Interpolator1D._finish_y_ s� � �
�I�I�g�� 3� 3�3� 4�� �<�<�1� ��B� ��W� �B��T�(�(�)�B��e�B��T�\�\� 1�2�3���b� �?�#�%)�%��4�<�<���B��*G�%H�I�A�� � �A��A��r c � � t j t j |� | j d� }|rl|j dd | j
k7 rPdj
| j
| j d | j
d | j � }t d|z � �|j |j d df� S )Nr � z{!r} + (N,) + {!r}zData must be of shape %s���) r �moveaxis�asarrayr r r �format�
ValueErrorr1 )r r �check�ok_shapes r � _reshape_yiz_Interpolator1D._reshape_yij s� � �
�[�[����B� �� � �q�
9�� �R�X�X�a�b�\�T�%8�%8�8�+�2�2�4�3F�3F�� � �}�~�3V�+/�+>�+>�~�� � �
�+N�P�H� � 7�(� B�C� C��z�z�2�8�8�A�;��+�,�,r c � � |� | j }|� t d� �t j |� }|j }|dk( rd}|� || t |� k7 r t d� �||j z | _ |j d | j |j | j dz d z | _ d | _ | j |j � y )Nz no interpolation axis specifiedr
�r: z@x and y arrays must be equal in length along interpolation axis.r: )
r r? r r= r r2 �ndimr r �
_set_dtype)r r r r r s r r z_Interpolator1D._set_yir s� � � �<��<�<�D� �<� � >�?� ?�
�Z�Z��^������ �B�;��E�
�>�e�D�k�S��W� 4� � 3� 4�
4� �r�w�w��� � �h�h�}�� � � 5�b�h�h�t�|�|�A�~��6O� O�����
� ������!r c �> � t j |t j � s.t j | j t j � rt j | _ y |r | j t j k7 rt j
| _ y y �N)r �
issubdtype�complexfloatingr �complex_�float_)r r �unions r rF z_Interpolator1D._set_dtype� s[ � �
�=�=��� 2� 2� 3��-�-��
�
�B�,>�,>�?����D�J��D�J�J�"�+�+� 5� �Y�Y��
� 6r )NNN)F)NN)
�__name__�
__module__� __qualname__�__doc__� __slots__r! r( r$ r# r% rB r rF r
r r r r s6 � � �> 7�I�/�*�2$� "� �-�"�('r r c � � e Zd Zdd�Zdd�Zy)� _Interpolator1DWithDerivativesNc � � | j |� \ }}| j ||� }|j |j d f|z | j z � }| j
dk7 r�|dk7 r�t
|� }t
| j � }dgt t |dz || j
z dz � � z t t d|dz � � z t t |dz | j
z ||z dz � � z }|j |� }|S )ag
Evaluate many derivatives of the polynomial at the point x
Produce an array of all derivative values at the point x.
Parameters
----------
x : array_like
Point or points at which to evaluate the derivatives
der : int or None, optional
How many derivatives to extract; None for all potentially
nonzero derivatives (that is a number equal to the number
of points). This number includes the function value as 0th
derivative.
Returns
-------
d : ndarray
Array with derivatives; d[j] contains the jth derivative.
Shape of d[j] is determined by replacing the interpolation
axis in the original array with the shape of x.
Examples
--------
>>> from scipy.interpolate import KroghInterpolator
>>> KroghInterpolator([0,0,0],[1,2,3]).derivatives(0)
array([1.0,2.0,3.0])
>>> KroghInterpolator([0,0,0],[1,2,3]).derivatives([0,0])
array([[1.0,1.0],
[2.0,2.0],
[3.0,3.0]])
r r
r: )
r# �_evaluate_derivativesr1 r r r r2 r3 r4 r5 )r r �derr& r' r6 r7 r8 s r � derivativesz*_Interpolator1DWithDerivatives.derivatives� s� � �D �_�_�Q�'�
��7� � &� &�q�#� .��
�I�I�q�w�w�q�z�m�g�-��0C�0C�C� D�� �<�<�1� ��B� ��W� �B��T�(�(�)�B���t�E�"�Q�$��T�\�\�(9�!�(;� <�=�=���a��A���'�(��e�B�q�D�� � � -�r�"�u�Q�w�7�8�9�A� � � �A��A��r c �~ � | j |� \ }}| j ||dz � }| j || |� S )a�
Evaluate one derivative of the polynomial at the point x
Parameters
----------
x : array_like
Point or points at which to evaluate the derivatives
der : integer, optional
Which derivative to extract. This number includes the
function value as 0th derivative.
Returns
-------
d : ndarray
Derivative interpolated at the x-points. Shape of d is
determined by replacing the interpolation axis in the
original array with the shape of x.
Notes
-----
This is computed by evaluating all derivatives up to the desired
one (using self.derivatives()) and then discarding the rest.
r: )r# rV r% )r r rW r& r' s r �
derivativez)_Interpolator1DWithDerivatives.derivative� sA � �4 �_�_�Q�'�
��7� � &� &�q�#�a�%� 0���~�~�a��f�g�.�.r rH rD )rN rO rP rX rZ r
r r rT rT � s
� �-�^ /r rT c �& � e Zd ZdZdd�Zd� Zdd�Zy)r a&
Interpolating polynomial for a set of points.
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.
Parameters
----------
xi : array_like, shape (npoints, )
Known x-coordinates. Must be sorted in increasing order.
yi : array_like, shape (..., npoints, ...)
Known y-coordinates. When an xi occurs two or more times in
a row, the corresponding yi's represent derivative values. The length of `yi`
along the interpolation axis must be equal to the length of `xi`. Use the
`axis` parameter to select the correct axis.
axis : int, optional
Axis in the `yi` array corresponding to the x-coordinate values. Defaults to
``axis=0``.
Notes
-----
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 [1]_.
References
----------
.. [1] Krogh, "Efficient Algorithms for Polynomial Interpolation
and Numerical Differentiation", 1970.
Examples
--------
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:
>>> import numpy as np
>>> 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.
c � � t j | |||� t j |� | _ | j |� | _ | j j \ | _ | _ | j j x}dkD rt j |� d�d�� t j | j dz | j f| j �� }| j d |d< t j | j | j f| j �� }t d| j � D ]� }d}||k r'|||z
|| k( r|dz
}||k r|||z
|| k( r�|dz }| j | t! |� z |d< t ||z
� D ][ } || || k( r t# d� �|dk( r || || z
|| || z
z || dz < �<|| dz || z
|| || z
z || dz < �] |||z
||< �� || _ y ) N� zv degrees provided, degrees higher than about thirty cause problems with numerical instability with 'KroghInterpolator'� )�
stacklevelr: �r r z Elements if `xi` can't be equal.)rT r! r r= r rB r r �n�r�size�warnings�warn�zerosr r4 r r? �c)
r r r r �degrg �Vk�kr8 �is
r r! zKroghInterpolator.__init__* s � �&�/�/��b�"�d�C��*�*�R�.����"�"�2�&��� ��� � �������7�7�<�<� �C�2� %� �M�M�S�E� "5� 5�AB�
D�
�H�H�d�f�f�Q�h����'�t�z�z� :���w�w�q�z��!��
�X�X�t�v�v�t�v�v�&�d�j�j�
9���q�$�&�&�!�
�A��A��q�&�R��!��W��1�� -��Q��� �q�&�R��!��W��1�� -�
��F�A��G�G�A�J��q� 1�1�B�q�E��1�Q�3�Z�
<���a�5�B�q�E�>�$�%G�H�H���6� ��t�B�q�E�z�B�q�E�"�Q�%�K� 8�B�q��s�G� !�!�A�#�w�r�!�u�}�r�!�u�R��U�{� ;�B�q��s�G�
<� �a��c�7�A�a�D�
� ��r c �~ � d}t j t |� | j f| j �� }|| j
dt j d d �f z
}t d| j � D ]F }|| j |dz
z
}||z }||d d �t j f | j
| z z
}�H |S )Nr: r` r )
r rf r2 rb r rg �newaxisr4 ra r )r r �pi�prj �ws r r$ zKroghInterpolator._evaluateI s� � �
�� �H�H�c�!�f�d�f�f�%�T�Z�Z� 8�� �T�V�V�A�b�j�j��N�
#�#���q�$�&�&�!� .�A��D�G�G�A�a�C�L� �A��2��B�
��A�b�j�j�L�!�D�F�F�1�I�-� -�A� .� �r Nc � � | j }| j }|� | j }t j |t |� f� }t j |t |� f� }d|d< t j t |� | j f| j
�� }|| j dt j d d �f z
}t d|� D ]\ }|| j |dz
z
||dz
< ||dz
||dz
z ||< |||d d �t j f | j | z z
}�^ t j t ||dz � t |� |f| j
�� } | d |dz �d d �d d �fxx | j d |dz �t j d d �f z
cc< || d< t d|� D ]v }t d||z
dz � D ]I }
|||
z dz
||
dz
z ||
z ||
< | | ||
d d �t j f | ||
z z z | |< �K | |xx t |� z cc< �x d| |d d �d d �f< | d | S )Nr: r r` ) ra rb r rf r2 r rg rm r4 r �maxr ) r r rW ra rb rn rp ro rj �cnrk s r rV z'KroghInterpolator._evaluate_derivativesS s7 � � �F�F�� �F�F�� �;��&�&�C�
�X�X�q�#�a�&�k�
"�� �H�H�a��Q��[� !����1�� �H�H�c�!�f�d�f�f�%�T�Z�Z� 8�� �T�V�V�A�r�z�z�1�$�
%�%���q�!�� 2�A������1�� �%�A�a��c�F��a��c�F�R��!��W�$�B�q�E�
��A�q�"�*�*�$�%����q� �1� 1�A� 2�
�X�X�s�3��!��}�c�!�f�a�0��
�
�
C��
�4�A�a�C�4��A�:��$�&�&��!�A�#��r�z�z�1�!4�5�5����1���q�!�� (�A��1�a��c�!�e�_�
=���!�A�#�a�%���A�a�C��(�2�a�5�0��1���1���1�a����#3� 4�R��!��W� <�<��1��
=�
�q�E�_�Q�'� '�E� (� ��1�a��7� ��$�3�x�r �r rH )rN rO rP rQ r! r$ rV r
r r r r � s � �I�V �>�r r c �� � t | ||�� }|dk( r ||� S t |� r|j ||�� S |j |t j
|� dz �� | S )a�
Convenience function for polynomial interpolation.
See `KroghInterpolator` for more details.
Parameters
----------
xi : array_like
Known x-coordinates.
yi : array_like
Known y-coordinates, of shape ``(xi.size, R)``. Interpreted as
vectors of length R, or scalars if R=1.
x : array_like
Point or points at which to evaluate the derivatives.
der : int or list, optional
How many derivatives to extract; None for all potentially
nonzero derivatives (that is a number equal to the number
of points), or a list of derivatives to extract. This number
includes the function value as 0th derivative.
axis : int, optional
Axis in the yi array corresponding to the x-coordinate values.
Returns
-------
d : ndarray
If the interpolator's values are R-D then the
returned array will be the number of derivatives by N by R.
If `x` is a scalar, the middle dimension will be dropped; if
the `yi` are scalars then the last dimension will be dropped.
See Also
--------
KroghInterpolator : Krogh interpolator
Notes
-----
Construction of the interpolating polynomial is a relatively expensive
process. If you want to evaluate it repeatedly consider using the class
KroghInterpolator (which is what this function uses).
Examples
--------
We can interpolate 2D observed data using krogh interpolation:
>>> import numpy as np
>>> import matplotlib.pyplot as plt
>>> from scipy.interpolate import krogh_interpolate
>>> x_observed = np.linspace(0.0, 10.0, 11)
>>> y_observed = np.sin(x_observed)
>>> x = np.linspace(min(x_observed), max(x_observed), num=100)
>>> y = krogh_interpolate(x_observed, y_observed, x)
>>> plt.plot(x_observed, y_observed, "o", label="observation")
>>> plt.plot(x, y, label="krogh interpolation")
>>> plt.legend()
>>> plt.show()
�r r �rW r: )r r rZ rX r �amax)r r r rW r �Ps r r r q sa � �t �"�b�t�,�A�
�a�x���t� � �3� ��|�|�A�#�|�&�&��}�}�Q�2�7�7�3�<��>�}�2�3�7�7r c
�d � |�|}|dz }|t j t j dt j ||dz �� � z |z }t | | |� � }|j ||dz �� }t j |t t j |dz � � z ddd� � S )a\
Estimate the Taylor polynomial of f at x by polynomial fitting.
Parameters
----------
f : callable
The function whose Taylor polynomial is sought. Should accept
a vector of `x` values.
x : scalar
The point at which the polynomial is to be evaluated.
degree : int
The degree of the Taylor polynomial
scale : scalar
The width of the interval to use to evaluate the Taylor polynomial.
Function values spread over a range this wide are used to fit the
polynomial. Must be chosen carefully.
order : int or None, optional
The order of the polynomial to be used in the fitting; `f` will be
evaluated ``order+1`` times. If None, use `degree`.
Returns
-------
p : poly1d instance
The Taylor polynomial (translated to the origin, so that
for example p(0)=f(x)).
Notes
-----
The appropriate choice of "scale" is a trade-off; too large and the
function differs from its Taylor polynomial too much to get a good
answer, too small and round-off errors overwhelm the higher-order terms.
The algorithm used becomes numerically unstable around order 30 even
under ideal circumstances.
Choosing order somewhat larger than degree may improve the higher-order
terms.
Examples
--------
We can calculate Taylor approximation polynomials of sin function with
various degrees:
>>> import numpy as np
>>> import matplotlib.pyplot as plt
>>> from scipy.interpolate import approximate_taylor_polynomial
>>> x = np.linspace(-10.0, 10.0, num=100)
>>> plt.plot(x, np.sin(x), label="sin curve")
>>> for degree in np.arange(1, 15, step=2):
... sin_taylor = approximate_taylor_polynomial(np.sin, 0, degree, 1,
... order=degree + 2)
... plt.plot(x, sin_taylor(x), label=f"degree={degree}")
>>> plt.legend(bbox_to_anchor=(1.05, 1), loc='upper left',
... borderaxespad=0.0, shadow=True)
>>> plt.tight_layout()
>>> plt.axis([-10, 10, -10, 10])
>>> plt.show()
Nr: r )�endpointrw r; ) r �cos�linspacern r rX �poly1dr �arange) �fr �degree�scale�orderra �xsry �ds r r
r
� s� � �v
�}���
�a��A�
�r�v�v�b�k�k�!�B�E�E�!�Q��U�;�<� <�q� @�B��"�a��e�$�A� �
�
�a�F�1�H�
�%�A�
�9�9�a� �"�)�)�F�1�H�"5�6�6��"��=� >�>r c �4 � e Zd ZdZdd�Zd d�Zd d�Zd� Zd� Zy)
r a� The interpolating polynomial for a set of points
Constructs a polynomial that passes through a given set of points.
Allows evaluation of the polynomial, efficient changing of the y
values to be interpolated, and updating by adding more x values.
For reasons of numerical stability, this function does not compute
the coefficients of the polynomial.
The values yi need to be provided before the function is
evaluated, but none of the preprocessing depends on them, so rapid
updates are possible.
Parameters
----------
xi : array_like, shape (npoints, )
1-D array of x coordinates of the points the polynomial
should pass through
yi : array_like, shape (..., npoints, ...), optional
N-D array of y coordinates of the points the polynomial should pass through.
If None, the y values will be supplied later via the `set_y` method.
The length of `yi` along the interpolation axis must be equal to the length
of `xi`. Use the ``axis`` parameter to select correct axis.
axis : int, optional
Axis in the yi array corresponding to the x-coordinate values. Defaults
to ``axis=0``.
Notes
-----
This class uses a "barycentric interpolation" method that treats
the problem as a special case of rational function interpolation.
This algorithm is quite stable, numerically, but 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.
Based on Berrut and Trefethen 2004, "Barycentric Lagrange Interpolation".
Nc �n � t j | |||� t j |� | _ | j |� t
| j � | _ dt j | j � t j | j � z
z | _
t j j | j � }t j | j t j �� }t j | j � ||< t j | j � | _ t# | j � D ][ }| j | j | | j | z
z }d||| < dt j$ |� z | j |< �] y )Ng @r` g �?)r r! r �asfarrayr �set_yir2 ra rr �min�
_inv_capacity�random� permutationrf �int32r �wir4 �prod)r r r r �permute� inv_permuterk �dists r r! z BarycentricInterpolator.__init__( s+ � �� � ��r�2�t�4��+�+�b�/��� � � �B���T�W�W� ��� !�B�F�F�4�7�7�O�b�f�f�T�W�W�o�$E� F����)�)�'�'����/���h�h�t�v�v�R�X�X�6� � !�y�y���� 0� �G� ��(�(�4�6�6�"����t�v�v� � -�A��%�%������d�g�g�g�6F�)F�G�D�#&�D��Q� � � �r�w�w�t�}�,�D�G�G�A�J� -r c �� � |�d| _ y| j || j |�� | j |� | _ | j j \ | _ | _ y)a
Update the y values to be interpolated
The barycentric interpolation algorithm requires the calculation
of weights, but these depend only on the xi. The yi can be changed
at any time.
Parameters
----------
yi : array_like
The y coordinates of the points the polynomial should pass through.
If None, the y values will be supplied later.
axis : int, optional
Axis in the yi array corresponding to the x-coordinate values.
Nr )r r r rB r ra rb )r r r s r r� z BarycentricInterpolator.set_yiB sP � �" �:��D�G� � � � �R�D�G�G�$� �/��"�"�2�&��� ��� � �����r c
� � |�Q| j � t d� �| j |d�� }t j | j |f� | _ n| j � t d� �| j
}t j | j |f� | _ t | j � | _ | xj dz c_ | j }t j | j
� | _ || j d| t || j
� D ]� }| j d|xxx | j | j | | j d| z
z z ccc t j j | j | j d| | j | z
z � | j |< �� | xj dz c_ y)a�
Add more x values to the set to be interpolated
The barycentric interpolation algorithm allows easy updating by
adding more points for the polynomial to pass through.
Parameters
----------
xi : array_like
The x coordinates of the points that the polynomial should pass
through.
yi : array_like, optional
The y coordinates of the points the polynomial should pass through.
Should have shape ``(xi.size, R)``; if R > 1 then the polynomial is
vector-valued.
If `yi` is not given, the y values will be supplied later. `yi`
should be given if and only if the interpolator has y values
specified.
Nz No previous yi value to update!T)r@ zNo update to yi provided!r; )r r? rB r �vstackra � concatenater r2 r� rf r4 r� �multiply�reduce)r r r �old_n�old_wi�js r �add_xiz BarycentricInterpolator.add_xiZ sj � �* �>��w�w�� �!B�C�C��!�!�"�D�!�1�B��i�i����� �-�D�G��w�w�"� �!<�=�=������.�.�$�'�'�"� �.����T�W�W� ��� ���B��������(�(�4�6�6�"��� ��������u�d�f�f�%� �A� �G�G�B�Q�K�4�-�-������D�G�G�B�Q�K�1G�H� H�K����+�+��"�"�d�g�g�b�q�k�$�'�'�!�*�&<�=��D�G�G�A�J� �
���B��r c �. � t j | |� S )a_ Evaluate the interpolating polynomial at the points x
Parameters
----------
x : array_like
Points to evaluate the interpolant at.
Returns
-------
y : array_like
Interpolated values. Shape is determined by replacing
the interpolation axis in the original array with the shape of x.
Notes
-----
Currently the code computes an outer product between x and the
weights, that is, it constructs an intermediate array of size
N by len(x), where N is the degree of the polynomial.
)r r( r+ s r r( z BarycentricInterpolator.__call__� s � �( �'�'��a�0�0r c � � |j dk( r/t j d| j f| j �� }|S |dt j
f | j z
}|dk( }d||< | j |z }t j d�� 5 t j || j � t j |d�� dt j
f z }d d d � t j |� }t |� dk( r(t |d � dkD r| j |d d }S | j |d |d d < |S # 1 sw Y �nxY w) Nr r` .r: �ignore)�divider; rv )rc r rf rb r rm r r� �errstate�dotr �sum�nonzeror2 )r r ro rg �zrb s r r$ z!BarycentricInterpolator._evaluate� s* � � �6�6�Q�;����!�T�V�V��D�J�J�7�A� �� �#�r�z�z�/�"�T�W�W�,�A��Q��A��A�a�D����� �A����H�-�
M��F�F�1�d�g�g�&������);�C����O�)L�L��
M� �
�
�1�
�A��1�v��{��q��t�9�q�=� ����!��Q��(�A� �� !�G�G�A�b�E�N��!�C�R�&� ���
M�
M�s
�A E � E)Nr rH ) rN rO rP rQ r! r� r� r( r$ r
r r r r � s" � �&�P-�4'�0)�V1�,r r c �* � t | ||�� |� S )a
Convenience function for polynomial interpolation.
Constructs a polynomial that passes through a given set of points,
then evaluates the polynomial. For reasons of numerical stability,
this function does not compute the coefficients of the polynomial.
This function uses a "barycentric interpolation" method that treats
the problem as a special case of rational function interpolation.
This algorithm is quite stable, numerically, but 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.
Parameters
----------
xi : array_like
1-D array of x coordinates of the points the polynomial should
pass through
yi : array_like
The y coordinates of the points the polynomial should pass through.
x : scalar or array_like
Points to evaluate the interpolator at.
axis : int, optional
Axis in the yi array corresponding to the x-coordinate values.
Returns
-------
y : scalar or array_like
Interpolated values. Shape is determined by replacing
the interpolation axis in the original array with the shape of x.
See Also
--------
BarycentricInterpolator : Bary centric interpolator
Notes
-----
Construction of the interpolation weights is a relatively slow process.
If you want to call this many times with the same xi (but possibly
varying yi or x) you should use the class `BarycentricInterpolator`.
This is what this function uses internally.
Examples
--------
We can interpolate 2D observed data using barycentric interpolation:
>>> import numpy as np
>>> import matplotlib.pyplot as plt
>>> from scipy.interpolate import barycentric_interpolate
>>> x_observed = np.linspace(0.0, 10.0, 11)
>>> y_observed = np.sin(x_observed)
>>> x = np.linspace(min(x_observed), max(x_observed), num=100)
>>> y = barycentric_interpolate(x_observed, y_observed, x)
>>> plt.plot(x_observed, y_observed, "o", label="observation")
>>> plt.plot(x, y, label="barycentric interpolation")
>>> plt.legend()
>>> plt.show()
rv )r )r r r r s r r r � s � �| 6� "�2�r�� 5�a� 8�8r )r r rH rt )rd �numpyr �
scipy.specialr �scipy._lib._utilr r �__all__r r rT r r r
r r r
r r �<module>r� sm �� � � #� @� G��C�
{'� {'�|L/�_� L/�^P�6� P�f@8�FH?�Vm�o� m�`>9r