numpy.polynomial.hermite_e.hermeval

numpy.polynomial.hermite_e.hermeval(x, cs)

Evaluate a Hermite series.

If cs is of length n, this function returns :

p(x) = cs[0]*P_0(x) + cs[1]*P_1(x) + ... + cs[n-1]*P_{n-1}(x)

If x is a sequence or array then p(x) will have the same shape as x. If r is a ring_like object that supports multiplication and addition by the values in cs, then an object of the same type is returned.

Parameters :

x : array_like, ring_like

Array of numbers or objects that support multiplication and addition with themselves and with the elements of cs.

cs : array_like

1-d array of Hermite coefficients ordered from low to high.

Returns :

values : ndarray, ring_like

If the return is an ndarray then it has the same shape as x.

See also

hermefit

Notes

The evaluation uses Clenshaw recursion, aka synthetic division.

Examples

>>> from numpy.polynomial.hermite_e import hermeval
>>> coef = [1,2,3]
>>> hermeval(1, coef)
3.0
>>> hermeval([[1,2],[3,4]], coef)
array([[  3.,  14.],
       [ 31.,  54.]])

Previous topic

numpy.polynomial.hermite_e.HermiteE.truncate

This Page