-
Hi @ingvildh,
as discussed this morning, one thing that could be quite useful, for studying A100s, would be to start by comparing the performance to our V100 baseline.
I would suggest to start …
-
Tensor products of combinatorial free modules still use an old version of
cartesian product. As a consequence extracting a coefficient is not possible:
```
sage: F = CombinatorialFreeModule(ZZ, [1,…
-
Before this ticket, e.g. in Sage 9.3.beta4:
```
sage: identity_matrix(ZZ, 2).is_sparse()
False
sage: diagonal_matrix(ZZ, 2, [1, 1]).is_sparse()
True
```
After this ticket, the sparseness should ma…
-
Current approach are not suitable for more general algebras:
1. Lattice consists of two semigroups, their operators have very similiar properties to each other and should not be assumed as additive…
ghost updated
7 years ago
-
### Steps To Reproduce
Currently, we have
```
sage: R = algebras.Free(QQ, ('a', 'b'), degrees=(1, 2))
sage: L = R.completion()
sage: e = L(R.gen(0))
sage: e, e.valuation(), e.shift(1), e.shift(1…
-
Following the progress with Ticket #30307, we propose to add computational functionalities with tensors via the tensor train decomposition, which is an idea originally named Matrix Product States in…
-
Somehow, I found myself needing to map a logsignature back to the full signature (where the logsignature can be in either the tensor algebra or a compressed form). It appears the relevant operations s…
-
`FreeModule` (from `sage.modules`) has a method `is_ambient` for distinguishing ambient modules from submodules.
We make this method available for `CombinatorialFreeModule` too via `ModulesWit…
-
## Description
1. khatri_rao was prematurely added to mx.nd/mx.sym namespace instead of contrib namespace which happened in https://github.com/apache/incubator-mxnet/pull/7781/files#r176510540.
2. k…
-
So I discovered a strange bug in the exp function when it is given a tensor with a non-zero unit element. I suspect the problem is in an optimisation of the multiplication logic but I will have to che…