numpy.polynomial.hermite.hermval(x, c, tensor=True)
[source]
Evaluate an Hermite series at points x.
If c
is of length n + 1
, this function returns the value:
The parameter x
is converted to an array only if it is a tuple or a list, otherwise it is treated as a scalar. In either case, either x
or its elements must support multiplication and addition both with themselves and with the elements of c
.
If c
is a 1-D array, then p(x)
will have the same shape as x
. If c
is multidimensional, then the shape of the result depends on the value of tensor
. If tensor
is true the shape will be c.shape[1:] + x.shape. If tensor
is false the shape will be c.shape[1:]. Note that scalars have shape (,).
Trailing zeros in the coefficients will be used in the evaluation, so they should be avoided if efficiency is a concern.
Parameters: |
x : array_like, compatible object If c : array_like Array of coefficients ordered so that the coefficients for terms of degree n are contained in c[n]. If tensor : boolean, optional If True, the shape of the coefficient array is extended with ones on the right, one for each dimension of New in version 1.7.0. |
---|---|
Returns: |
values : ndarray, algebra_like The shape of the return value is described above. |
See also
The evaluation uses Clenshaw recursion, aka synthetic division.
>>> from numpy.polynomial.hermite import hermval >>> coef = [1,2,3] >>> hermval(1, coef) 11.0 >>> hermval([[1,2],[3,4]], coef) array([[ 11., 51.], [ 115., 203.]])
© 2008–2017 NumPy Developers
Licensed under the NumPy License.
https://docs.scipy.org/doc/numpy-1.14.2/reference/generated/numpy.polynomial.hermite.hermval.html