legmul(c1, c2)
Returns the product of two Legendre series :None:None:`c1`
* :None:None:`c2`
. The arguments are sequences of coefficients, from lowest order "term" to highest, e.g., [1,2,3] represents the series P_0 + 2*P_1 + 3*P_2
.
In general, the (polynomial) product of two C-series results in terms that are not in the Legendre polynomial basis set. Thus, to express the product as a Legendre series, it is necessary to "reproject" the product onto said basis set, which may produce "unintuitive" (but correct) results; see Examples section below.
1-D arrays of Legendre series coefficients ordered from low to high.
Of Legendre series coefficients representing their product.
Multiply one Legendre series by another.
>>> from numpy.polynomial import legendre as LSee :
... c1 = (1,2,3)
... c2 = (3,2)
... L.legmul(c1,c2) # multiplication requires "reprojection" array([ 4.33333333, 10.4 , 11.66666667, 3.6 ]) # may vary
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.legadd
numpy.polynomial.legendre.legpow
numpy.polynomial.legendre.legdiv
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