legdiv(c1, c2)
Returns the quotient-with-remainder 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) division of one Legendre series by another results in quotient and remainder terms that are not in the Legendre polynomial basis set. Thus, to express these results as a Legendre series, it is necessary to "reproject" the results onto the Legendre 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 the quotient and remainder.
Divide one Legendre series by another.
>>> from numpy.polynomial import legendre as L
... c1 = (1,2,3)
... c2 = (3,2,1)
... L.legdiv(c1,c2) # quotient "intuitive," remainder not (array([3.]), array([-8., -4.]))
>>> c2 = (0,1,2,3)See :
... L.legdiv(c2,c1) # neither "intuitive" (array([-0.07407407, 1.66666667]), array([-1.03703704, -2.51851852])) # 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.legmul
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