I assume you want to apply them element-wise?
Not yet, but we're about to add some functional combinators to the linear algebra types, like Map which would apply a provided function/lambda as argument to all entries of the matrix (something like
Thanks,
Christoph
Not yet, but we're about to add some functional combinators to the linear algebra types, like Map which would apply a provided function/lambda as argument to all entries of the matrix (something like
m.MapInplace(Math.Sin);
). These combinators will then be optimized to the actual storage scheme so it should indeed be more efficient than looping through the elements from the outside, especially for sparse schemes but also for dense matrices (since we can do a straight loop without any index computations).Thanks,
Christoph