You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The simplest approach is to define a n-dimensional data structure, together with a few operations (access, slicing). Then 2-d (resp. 1-d) tensors can be converted to matrices (resp. vectors) without copying, and viceversa.
This already would give us the possibility move around higher-dimensional data, and then treat slices of these data as matrices and vectors to perform linear algebraic operations.
Tensor contraction (dot) can be implemented in these terms, or perhaps directly on top of gemm
The text was updated successfully, but these errors were encountered:
The simplest approach is to define a n-dimensional data structure, together with a few operations (access, slicing). Then 2-d (resp. 1-d) tensors can be converted to matrices (resp. vectors) without copying, and viceversa.
This already would give us the possibility move around higher-dimensional data, and then treat slices of these data as matrices and vectors to perform linear algebraic operations.
Tensor contraction (
dot
) can be implemented in these terms, or perhaps directly on top ofgemm
The text was updated successfully, but these errors were encountered: