>> from numpy.polynomial import polyutils as pu
>>> a = np.arange(4)
>>> pu.as_series(a)
[array([0.]), array([1.]), array([2.]), array([3.])]
>>> b = np.arange(6).reshape((2,3))
>>> pu.as_series(b)
[array([0., 1., 2.]), array([3., 4., 5.])]
>>> pu.as_series((1, np.arange(3), np.arange(2, dtype=np.float16)))
[array([1.]), array([0., 1., 2.]), array([0., 1.])]
>>> pu.as_series([2, [1.1, 0.]])
[array([2.]), array([1.1])]
>>> pu.as_series([2, [1.1, 0.]], trim=False)
[array([2.]), array([1.1, 0. ])]
c < g | ]}t j |d d S )r F)ndmincopynparray.0as r
z as_series.. s)
>
>
>1bhq...
>
>
>r c g | ] }|j
S r )sizer$ s r r' z as_series.. s # # #qAF # # #r r zCoefficient array is emptyc 3 , K | ]}|j d k V dS )r N)ndimr$ s r z as_series.. s(
'
'116Q;
'
'
'
'
'
'r z Coefficient array is not 1-dc , g | ]}t | S r )r r$ s r r' z as_series.. s ---'!**---r c 3 Z K | ]&}|j t j t k V 'd S N)dtyper" objectr$ s r r, z as_series.. s3
7
7117bhv&& &
7
7
7
7
7
7r r0 Nz&Coefficient arrays have no common typec > g | ]}t j |d S )T)r r0 r! )r% r& r0 s r r' z as_series.. s* CCCqrxE222CCCr ) min
ValueErroranyr0 r" r1 emptyr appendr common_type Exception)alisttrimarraysretr& tmper0 s @r r r T s d ?
>
>
>
>F
# #F # # #$$))5666
'
'
'
'
''' 97888 .--f---
7
7
7
7
777 D % %Aw"(6****hs1vvRXf-=-=>>>111AAA
3
16688$$$$
% NNF+EE N N N EFFA M NCCCCFCCC Js :E
E(E##E(c 2 |dk rt d t | g \ } t j t j | |k \ }t | dk r
| dd dz S | d|d dz S )a0
Remove "small" "trailing" coefficients from a polynomial.
"Small" means "small in absolute value" and is controlled by the
parameter `tol`; "trailing" means highest order coefficient(s), e.g., in
``[0, 1, 1, 0, 0]`` (which represents ``0 + x + x**2 + 0*x**3 + 0*x**4``)
both the 3-rd and 4-th order coefficients would be "trimmed."
Parameters
----------
c : array_like
1-d array of coefficients, ordered from lowest order to highest.
tol : number, optional
Trailing (i.e., highest order) elements with absolute value less
than or equal to `tol` (default value is zero) are removed.
Returns
-------
trimmed : ndarray
1-d array with trailing zeros removed. If the resulting series
would be empty, a series containing a single zero is returned.
Raises
------
ValueError
If `tol` < 0
See Also
--------
trimseq
Examples
--------
>>> from numpy.polynomial import polyutils as pu
>>> pu.trimcoef((0,0,3,0,5,0,0))
array([0., 0., 3., 0., 5.])
>>> pu.trimcoef((0,0,1e-3,0,1e-5,0,0),1e-3) # item == tol is trimmed
array([0.])
>>> i = complex(0,1) # works for complex
>>> pu.trimcoef((3e-4,1e-3*(1-i),5e-4,2e-5*(1+i)), 1e-3)
array([0.0003+0.j , 0.001 -0.001j])
r ztol must be non-negativeNr r )r5 r r" nonzeroabsr r )ctolinds r r r s X Qww3444
QC..CQ Jrvayy3 ' 'ES
3xx1}}!uQw #b'A+ ##%%%r c t | gd \ } | j j t j d v r| j | j }}| j | j }}t j t || t || f S t j | | f S )a;
Return a domain suitable for given abscissae.
Find a domain suitable for a polynomial or Chebyshev series
defined at the values supplied.
Parameters
----------
x : array_like
1-d array of abscissae whose domain will be determined.
Returns
-------
domain : ndarray
1-d array containing two values. If the inputs are complex, then
the two returned points are the lower left and upper right corners
of the smallest rectangle (aligned with the axes) in the complex
plane containing the points `x`. If the inputs are real, then the
two points are the ends of the smallest interval containing the
points `x`.
See Also
--------
mapparms, mapdomain
Examples
--------
>>> from numpy.polynomial import polyutils as pu
>>> points = np.arange(4)**2 - 5; points
array([-5, -4, -1, 4])
>>> pu.getdomain(points)
array([-5., 4.])
>>> c = np.exp(complex(0,1)*np.pi*np.arange(12)/6) # unit circle
>>> pu.getdomain(c)
array([-1.-1.j, 1.+1.j])
Fr< Complex) r r0 charr" typecodesrealr4 maximagr# complex)xrminrmaximinimaxs r r
r
s L QCe
$
$
$CQw|r|I...VZZ\\16::< new[i]``, ``i = 0, 1``.
Parameters
----------
old, new : array_like
Domains. Each domain must (successfully) convert to a 1-d array
containing precisely two values.
Returns
-------
offset, scale : scalars
The map ``L(x) = offset + scale*x`` maps the first domain to the
second.
See Also
--------
getdomain, mapdomain
Notes
-----
Also works for complex numbers, and thus can be used to calculate the
parameters required to map any line in the complex plane to any other
line therein.
Examples
--------
>>> from numpy.polynomial import polyutils as pu
>>> pu.mapparms((-1,1),(-1,1))
(0.0, 1.0)
>>> pu.mapparms((1,-1),(-1,1))
(-0.0, -1.0)
>>> i = complex(0,1)
>>> pu.mapparms((-i,-1),(1,i))
((1+1j), (1-0j))
r r r )oldnewoldlennewlenoffscls r r r s` R Vc!f_F
Vc!f_F q6#a&=3q6#a&= (&
0C
-C 8Or c ` t j | } t || \ }}||| z z S )a3
Apply linear map to input points.
The linear map ``offset + scale*x`` that maps the domain `old` to
the domain `new` is applied to the points `x`.
Parameters
----------
x : array_like
Points to be mapped. If `x` is a subtype of ndarray the subtype
will be preserved.
old, new : array_like
The two domains that determine the map. Each must (successfully)
convert to 1-d arrays containing precisely two values.
Returns
-------
x_out : ndarray
Array of points of the same shape as `x`, after application of the
linear map between the two domains.
See Also
--------
getdomain, mapparms
Notes
-----
Effectively, this implements:
.. math::
x\_out = new[0] + m(x - old[0])
where
.. math::
m = \frac{new[1]-new[0]}{old[1]-old[0]}
Examples
--------
>>> from numpy.polynomial import polyutils as pu
>>> old_domain = (-1,1)
>>> new_domain = (0,2*np.pi)
>>> x = np.linspace(-1,1,6); x
array([-1. , -0.6, -0.2, 0.2, 0.6, 1. ])
>>> x_out = pu.mapdomain(x, old_domain, new_domain); x_out
array([ 0. , 1.25663706, 2.51327412, 3.76991118, 5.02654825, # may vary
6.28318531])
>>> x - pu.mapdomain(x_out, new_domain, old_domain)
array([0., 0., 0., 0., 0., 0.])
Also works for complex numbers (and thus can be used to map any line in
the complex plane to any other line therein).
>>> i = complex(0,1)
>>> old = (-1 - i, 1 + i)
>>> new = (-1 + i, 1 - i)
>>> z = np.linspace(old[0], old[1], 6); z
array([-1. -1.j , -0.6-0.6j, -0.2-0.2j, 0.2+0.2j, 0.6+0.6j, 1. +1.j ])
>>> new_z = pu.mapdomain(z, old, new); new_z
array([-1.0+1.j , -0.6+0.6j, -0.2+0.2j, 0.2-0.2j, 0.6-0.6j, 1.0-1.j ]) # may vary
)r"
asanyarrayr )rP rV rW rZ r[ s r r r 3 s5 ~
aAS!!HC Q;r c d t j g|z }t d || < t | S r/ )r" newaxisslicetuple)r r+ sls r
_nth_slicerc w s+
* B $KKBqE 99r c t t k r"t d dt t k r"t d dt dk rt d t t j t d dz fd t D }t
j t j | S )
am
A generalization of the Vandermonde matrix for N dimensions
The result is built by combining the results of 1d Vandermonde matrices,
.. math::
W[i_0, \ldots, i_M, j_0, \ldots, j_N] = \prod_{k=0}^N{V_k(x_k)[i_0, \ldots, i_M, j_k]}
where
.. math::
N &= \texttt{len(points)} = \texttt{len(degrees)} = \texttt{len(vander\_fs)} \\
M &= \texttt{points[k].ndim} \\
V_k &= \texttt{vander\_fs[k]} \\
x_k &= \texttt{points[k]} \\
0 \le j_k &\le \texttt{degrees[k]}
Expanding the one-dimensional :math:`V_k` functions gives:
.. math::
W[i_0, \ldots, i_M, j_0, \ldots, j_N] = \prod_{k=0}^N{B_{k, j_k}(x_k[i_0, \ldots, i_M])}
where :math:`B_{k,m}` is the m'th basis of the polynomial construction used along
dimension :math:`k`. For a regular polynomial, :math:`B_{k, m}(x) = P_m(x) = x^m`.
Parameters
----------
vander_fs : Sequence[function(array_like, int) -> ndarray]
The 1d vander function to use for each axis, such as ``polyvander``
points : Sequence[array_like]
Arrays of point coordinates, all of the same shape. The dtypes
will be converted to either float64 or complex128 depending on
whether any of the elements are complex. Scalars are converted to
1-D arrays.
This must be the same length as `vander_fs`.
degrees : Sequence[int]
The maximum degree (inclusive) to use for each axis.
This must be the same length as `vander_fs`.
Returns
-------
vander_nd : ndarray
An array of shape ``points[0].shape + tuple(d + 1 for d in degrees)``.
z Expected z" dimensions of sample points, got z dimensions of degrees, got r z9Unable to guess a dtype or shape when no points are givenF)r c 3 K | ]9} | | | d t | z V :dS )).N)rc )r% r degreesn_dimspoints vander_fss r r, z _vander_nd.. sc
! VAY
++FZ65J5J,JK r )
r r5 ra r" r# r functoolsreduceoperatormul)rj ri rg
vander_arraysrh s ``` @r
_vander_ndrp } s' Z ^^F
V O O O#f++ O OQ Q Q
W J J JCLL J JL L L
{{TUUU 28E&MM666<
=
=F v M HL- 8 88r c t | || }| |j dt | dz S )z
Like `_vander_nd`, but flattens the last ``len(degrees)`` axes into a single axis
Used to implement the public ``vanderd`` functions.
N)r )rp reshapeshaper )rj ri rg vs r _vander_nd_flatru s? 9fg..A 99QW^s7||m^,u4 5 55r c t | dk rt j d S t |gd \ }| fd|D t }|dk rWt |d \ }fdt
D }|r |d d |d< |}|dk Wd S ) a
Helper function used to implement the ``fromroots`` functions.
Parameters
----------
line_f : function(float, float) -> ndarray
The ``line`` function, such as ``polyline``
mul_f : function(array_like, array_like) -> ndarray
The ``mul`` function, such as ``polymul``
roots
See the ``fromroots`` functions for more detail
r r FrH c * g | ]} | d S )r r )r% rline_fs r r' z _fromroots.. s% * * *qVVQB]] * * *r c F g | ] } | |z S r r )r% r mmul_fps r r' z _fromroots.. s1 9991551q1v&&999r r )r r" onesr sortdivmodr )ry r} rootsnrx r? r| r~ s `` @@r
_fromrootsr s 5zzQwqzzUG%000
* * * *E * * * FF!ee!Q<vald`` functions.
Parameters
----------
val_f : function(array_like, array_like, tensor: bool) -> array_like
The ``val`` function, such as ``polyval``
c, args
See the ``vald`` functions for more detail
c 6 g | ]}t j | S r )r" r] r$ s r r' z_valnd.. s" + + +BM! + + +r r c 3 . K | ]}|j k V d S r/ )rs )r% r& shape0s r r, z_valnd.. s* 44a6!444444r r N zx, y, z are incompatiblerz zx, y are incompatiblezordinates are incompatibleF)tensor)rs allr r5 iternext)val_frD argsitx0xir s @r _valndr s , +d + + +D
!W]F 444448444 5 5 ; t99>> 788 8
YY!^^ 455 5 9:: :
dB
bB b! A ' ' E"a & & & Hr c ( |D ]} | || }|S )a6
Helper function used to implement the ``gridd`` functions.
Parameters
----------
val_f : function(array_like, array_like, tensor: bool) -> array_like
The ``val`` function, such as ``polyval``
c, args
See the ``gridd`` functions for more detail
r )r rD r r s r _gridndr s) E"aLL Hr c t ||g \ }}|d dk rt t | }t | }||k r|dd dz |fS |dk r||d z |dd dz fS t j ||z
dz |j }|}t
||z
dd D ]D} | dg|z dgz | }|d |d z } |dd | |dd z z
}| ||< E|t | fS )a
Helper function used to implement the ``div`` functions.
Implementation uses repeated subtraction of c2 multiplied by the nth basis.
For some polynomial types, a more efficient approach may be possible.
Parameters
----------
mul_f : function(array_like, array_like) -> array_like
The ``mul`` function, such as ``polymul``
c1, c2
See the ``div`` functions for more detail
r r Nr r2 )r ZeroDivisionErrorr r" r7 r0 r r )
r} c1c2lc1lc2quoremr r~ qs
r _divr s9 "b""HR "v{{ !!!
b''C
b''C
Syy"1"vax| "R&y"RaR&(""hsSy1}BH555sSy#r** Aqc!eqck2&&AB"
Acrc(Qq"vX%CCFFGCLL r c t | |g \ } }t | t | k r| d|j xx |z
cc< | }n|d| j xx | z
cc< |}t | S )z@ Helper function used to implement the ``add`` functions. Nr r r) r r r r> s r _addr < s "b""HR
2wwR
8BG8
8BG8 3<<r c t | |g \ } }t | t | k r| d|j xx |z cc< | }n | }|d| j xx | z
cc< |}t | S )z@ Helper function used to implement the ``sub`` functions. Nr r s r _subr I s "b""HR
2wwR
8BG8 S
8BG8 3<<r Fc t j | dz }t j | dz }t j | }|j dk s|j j dvs |j dk rt
d | dk rt d |j dk rt
d |j dk rt
d |j dk s |j d k rt
d
t | t | k rt
d |j dk r|}|dz } | || } nAt j
| }|d }t | } | || d
d
|f } | j }
|j } |jt j | dz }|j dk rt
d t | t | k rt
d |
|z }
| |z } |.t | t j |j j
z }t |
j j t j rYt j t j |
j t j |
j z d } n9t j t j |
d } d| | dk < t j |
j | z | j | \ }
}}}|
j | z j }
|j dk r\|
j d k r,t j |dz |
j d f|
j }n t j |dz |
j }|
||< |}
||k r |s d}t5 j |t8 d |r|
||||gfS |
S )a
Helper function used to implement the ``fit`` functions.
Parameters
----------
vander_f : function(array_like, int) -> ndarray
The 1d vander function, such as ``polyvander``
c1, c2
See the ``fit`` functions for more detail
re r iur z0deg must be an int or non-empty 1-D array of intzexpected deg >= 0zexpected 1D vector for xz expected non-empty vector for xrz z expected 1D or 2D array for yz$expected x and y to have same lengthr Nzexpected 1D vector for wz$expected x and w to have same lengthr2 z!The fit may be poorly conditioned
stacklevel) r" asarrayr+ r0 kindr) TypeErrorr4 r5 r r Tfinfoeps
issubclasstypecomplexfloatingsqrtsquarerL rN sumlinalglstsqzerosrs warningswarnr )vander_frP ydegrcondfullwlmaxordervanlhsrhsr[ rD residsranksccmsgs r _fitr W s
1
A
1
A
*S//C x!||sy~T11SX]]JKKK
wwyy1}},---v{{2333v{{9:::vzzQVaZZ7888
1vvQ>???
x1}}qhq$ gcll2wChq$ 3' %C
#C} JqMMC 6Q;; 677 7 q66SVV BCC C AgAg
}Arx((,, #).""455 -gry**RYsx-@-@@EEaHHIIgbinn((++,,CqM sCE5AAAvtQ
S A x!|| 6Q;;46171:.ag>>>BB$q&000B3 u}}T}1
c;15555 64E***r c H t |g \ }t | }||k s|dk rt d |||k rt d |dk r t j dg|j S |dk r|S |}t
d|dz D ]} | || }|S )af
Helper function used to implement the ``pow`` functions.
Parameters
----------
mul_f : function(array_like, array_like) -> ndarray
The ``mul`` function, such as ``polymul``
c : array_like
1-D array of array of series coefficients
pow, maxpower
See the ``pow`` functions for more detail
r z%Power must be a non-negative integer.NzPower is too larger r2 rz )r intr5 r" r# r0 r )r} rD powmaxpowerpowerprdr s r _powr s QC..CQ HHE ||uqyy@AAA %("2"2-... !x17++++ ! q%!)$$ A%Q--CC
r c t j | S # t $ rf} t | }|| k r't j d| dt d |cY d}~S n# t $ r Y nw xY wt | d |d}~ww xY w)a
Like `operator.index`, but emits a deprecation warning when passed a float
Parameters
----------
x : int-like, or float with integral value
Value to interpret as an integer
desc : str
description to include in any error message
Raises
------
TypeError : if x is a non-integral float or non-numeric
DeprecationWarning : if x is an integral float
z)In future, this will raise TypeError, as z7 will need to be an integer not just an integral float.r r Nz must be an integer)rm indexr r r r DeprecationWarning)rP descr@ ixs r _deprecate_as_intr s =~a = = = QB Qww
H H H H& D 4444551r s 8 H H H H H H H H % % % % % % +