Document

legadd(c1, c2)

Returns the sum of two Legendre series :None:None:`c1` + :None:None:`c2`. The arguments are sequences of coefficients ordered from lowest order term to highest, i.e., [1,2,3] represents the series P_0 + 2*P_1 + 3*P_2 .

Notes

Unlike multiplication, division, etc., the sum of two Legendre series is a Legendre series (without having to "reproject" the result onto the basis set) so addition, just like that of "standard" polynomials, is simply "component-wise."

Parameters

c1, c2 : array_like: 1-D arrays of Legendre series coefficients ordered from low to high.

Returns

out : ndarray: Array representing the Legendre series of their sum.

Add one Legendre series to another.

Examples

>>> from numpy.polynomial import legendre as L
... c1 = (1,2,3)
... c2 = (3,2,1)
... L.legadd(c1,c2)
array([4.,  4.,  4.])

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

numpy.polynomial.legendre.legsub numpy.polynomial.legendre.legmulx numpy.polynomial.legendre.legpow numpy.polynomial.legendre.legdiv numpy.polynomial.legendre.legmul

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them