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
It would be highly beneficial for tensor calculus applications, and higher generality, to include the case of a rank 0 tensor. This is of particular usefulness for scientific codes to avoid adding special cases.
The text was updated successfully, but these errors were encountered:
This is a great suggestion! I have been using the Haskell array-computation library 'Accelerate' for a couple of months for a project now, and they use rank 0 tensors in very much the same way.
However, adding this to the library as-is would be a major breaking change, since a lot of the functionality expects e.g. to return a bare inner value. That said, Tensor is now multiple years old and there are definitely other things about the API that could be improved for a hypothetical v 2.0.
What kind of behaviour would you like to see exactly for rank-0 tensors? What is your opinion on how 'simple' values should be converted to- and from rank-0 tensors?
It would be highly beneficial for tensor calculus applications, and higher generality, to include the case of a rank 0 tensor. This is of particular usefulness for scientific codes to avoid adding special cases.
The text was updated successfully, but these errors were encountered: