-
Schur decomposition is implemented efficiently on GPU in PyTorch, Jax, and MatLab. It is an essential ingredient for the efficient computation of matrix square root (sqrtm).
It would be ideal to ha…
-
The following `u3_decompositions` function
https://github.com/qiboteam/qibo/blob/19368f211c29d0831e5de2ed0b349cf51d235f12/src/qibo/transpiler/unitary_decompositions.py#L18-L35
holds only for matrice…
-
### Describe the issue
When convex decomposition parts are built for an object, disabling the rigid body does not properly work anymore. This appears to be due to the created parts objects not bein…
-
Hello, as I am new to your repository, where in the code is the eigendecomposition of a large sparse matrix? and what sparse linear algebra solver did you use?
-
Dear Friends, thank you very much for writing this code implementation of FREEMAN decomposition, which solved a big problem I encountered. Thank you,But there are still a few questions that I don’t …
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
[Pierre Comon - Lots of tensor work!](http://www.gipsa-lab.grenoble-inp.fr/~pierre.comon/publications_en.html)
http://www.stat.rice.edu/~gallen/reg_tensor_jsm_talk.pdf
http://www.slideshare.net/yoko…
-
I am aware of PR #904 that will add generic eigenvalue solving to all backends - awesome! Can't wait!
In the meantime, a smaller subset of eigenvalue problems are those where the matrix is upper H…
ibell updated
7 years ago
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
(stupid idea: if you think Gemini gambit also needs shorthand, make it shambit -Shame + gambit)