hermgrid3d(x, y, z, c)
This function returns the values:
$$p(a,b,c) = \sum_{i,j,k} c_{i,j,k} * H_i(a) * H_j(b) * H_k(c)$$where the points :None:None:`(a, b, c)` consist of all triples formed by taking a from x, :None:None:`b` from y, and c from z. The resulting points form a grid with x in the first dimension, y in the second, and z in the third.
The parameters x, y, and z are converted to arrays only if they are tuples or a lists, otherwise they are treated as a scalars. In either case, either x, y, and z or their elements must support multiplication and addition both with themselves and with the elements of c.
If c has fewer than three dimensions, ones are implicitly appended to its shape to make it 3-D. The shape of the result will be c.shape[3:] + x.shape + y.shape + z.shape.
The three dimensional series is evaluated at the points in the Cartesian product of x, y, and z. If x,`y`, or z is a list or tuple, it is first converted to an ndarray, otherwise it is left unchanged and, if it isn't an ndarray, it is treated as a scalar.
Array of coefficients ordered so that the coefficients for terms of degree i,j are contained in c[i,j]
. If c has dimension greater than two the remaining indices enumerate multiple sets of coefficients.
The values of the two dimensional polynomial at points in the Cartesian product of x and y.
Evaluate a 3-D Hermite series on the Cartesian product of x, y, and z.
The following pages refer to to this document either explicitly or contain code examples using this.
numpy.polynomial.hermite.hermval
numpy.polynomial.hermite.hermval3d
numpy.polynomial.hermite.hermval2d
numpy.polynomial.hermite.hermgrid2d
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