hermfromroots(roots)
The function returns the coefficients of the polynomial
$$p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),$$in Hermite form, where the :None:None:`r_n` are the roots specified in roots
. If a zero has multiplicity n, then it must appear in roots
n times. For instance, if 2 is a root of multiplicity three and 3 is a root of multiplicity 2, then roots
looks something like [2, 2, 2, 3, 3]. The roots can appear in any order.
If the returned coefficients are :None:None:`c`, then
The coefficient of the last term is not generally 1 for monic polynomials in Hermite form.
Sequence containing the roots.
1-D array of coefficients. If all roots are real then :None:None:`out` is a real array, if some of the roots are complex, then :None:None:`out` is complex even if all the coefficients in the result are real (see Examples below).
Generate a Hermite series with given roots.
>>> from numpy.polynomial.hermite import hermfromroots, hermval
... coef = hermfromroots((-1, 0, 1))
... hermval((-1, 0, 1), coef) array([0., 0., 0.])
>>> coef = hermfromroots((-1j, 1j))See :
... hermval((-1j, 1j), coef) array([0.+0.j, 0.+0.j])
The following pages refer to to this document either explicitly or contain code examples using this.
numpy.polynomial.polynomial.polyfromroots
numpy.polynomial.chebyshev.chebfromroots
numpy.polynomial.hermite_e.hermefromroots
numpy.polynomial.legendre.legfromroots
numpy.polynomial.laguerre.lagfromroots
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