-
Related to #470, I have been wondering if we should make the convergence handling consistent and reusable across methods. Currently, methods handle convergence checks in slightly different ways—some h…
-
hi, I am in a puzzle about the inference time of the compressed model. Why is the compressed model more time consuming? Shouldn't it be faster with fewer parameters(about half of the orignal) ?
thx
-
### What is the expected enhancement?
Improve the way we implement controls of general gates, e.g. by
1. checking whether the gate instance we try to control implements an efficient way to c…
-
### 🐛 Describe the bug
Compare this meta implementation to the one registered in native_functions.yaml. Meta implementation is missing the `non_blocking` argument.
https://github.com/pytorch/pytorch…
-
we soon will move this repo to : https://github.com/lichtkind/Perl6-Math-Matrix
and have to change this as well
https://github.com/perl6/doc/blob/master/doc/Language/math.pod6
https://github.com/…
-
### Problem Description
Many problems that are NP-complete for arbitrary graphs can be solved efficiently (usually using dynamic programming) for graphs of bounded treewidth and its [tree decompositi…
-
With these solvers, is it safe to assume that the arguments L and U both contain the main diagonal with the test suites used for grading?
-
In this ticket, I add implementations for the following decompositions:
* Decompositions for square matrices over non-archimedean local fields:
1. **Iwasawa**.
2. **Cartan**.
3. **Bruhat-Iwahori**.…
-
I have an interative algorithm that:
1) performs SVD on a matrix,
2) slightly modifies the original matrix, and
3) performs SVD on the new matrix,
4) iterates until 1,2,3 until convergence
…
-
Following [this paper](https://doi.org/10.1016/j.jsc.2016.01.002), we can implement the algorithms described there to compute normal forms of differential rational functions and, in addition, being ab…