getdomain(x)
Find a domain suitable for a polynomial or Chebyshev series defined at the values supplied.
1-d array of abscissae whose domain will be determined.
1-d array containing two values. If the inputs are complex, then the two returned points are the lower left and upper right corners of the smallest rectangle (aligned with the axes) in the complex plane containing the points x
. If the inputs are real, then the two points are the ends of the smallest interval containing the points x
.
Return a domain suitable for given abscissae.
>>> from numpy.polynomial import polyutils as pu
... points = np.arange(4)**2 - 5; points array([-5, -4, -1, 4])
>>> pu.getdomain(points) array([-5., 4.])
>>> c = np.exp(complex(0,1)*np.pi*np.arange(12)/6) # unit circleSee :
... pu.getdomain(c) array([-1.-1.j, 1.+1.j])
The following pages refer to to this document either explicitly or contain code examples using this.
numpy.polynomial.polyutils.mapdomain
numpy.polynomial.polyutils.mapparms
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