triu(m, k=0)
This docstring was copied from numpy.triu.
Some inconsistencies with the Dask version may exist.
Return a copy of an array with the elements below the :None:None:`k`-th diagonal zeroed. For arrays with ndim
exceeding 2, triu
will apply to the final two axes.
Please refer to the documentation for tril
for further details.
Upper triangle of an array.
tril
lower triangle of an array
>>> np.triu([[1,2,3],[4,5,6],[7,8,9],[10,11,12]], -1) # doctest: +SKIP array([[ 1, 2, 3], [ 4, 5, 6], [ 0, 8, 9], [ 0, 0, 12]])This example is valid syntax, but we were not able to check execution
>>> np.triu(np.arange(3*4*5).reshape(3, 4, 5)) # doctest: +SKIP array([[[ 0, 1, 2, 3, 4], [ 0, 6, 7, 8, 9], [ 0, 0, 12, 13, 14], [ 0, 0, 0, 18, 19]], [[20, 21, 22, 23, 24], [ 0, 26, 27, 28, 29], [ 0, 0, 32, 33, 34], [ 0, 0, 0, 38, 39]], [[40, 41, 42, 43, 44], [ 0, 46, 47, 48, 49], [ 0, 0, 52, 53, 54], [ 0, 0, 0, 58, 59]]])See :
The following pages refer to to this document either explicitly or contain code examples using this.
dask.array.routines.tril
dask.array.routines.triu_indices
dask.array.routines.triu_indices_from
dask.array.routines.triu
dask.array.routines.tril_indices
dask.array.creation.diag
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