Evaluate a Laguerre 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 1D 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
c : array_like
tensor : boolean, optional


Returns :  values : ndarray, algebra_like

Notes
The evaluation uses Clenshaw recursion, aka synthetic division.
Examples
>>> from numpy.polynomial.laguerre import lagval
>>> coef = [1,2,3]
>>> lagval(1, coef)
0.5
>>> lagval([[1,2],[3,4]], coef)
array([[0.5, 4. ],
[4.5, 2. ]])