compute linear combination of polynomials efficiently (like clenshaw)

[nschloe]

The Clenshaw algorithm allows the efficient computation of linear combination of recurrence-scheme polynomials. It'd be nice if this could be extended to all of the polynomials classes in orthopy.

(Suggestion by Rob Kirby.)