-
### Initial check.
- [X] I added a very descriptive title above.
- [X] I searched the documentation and found no similar feature.
- [X] I searched through the issues in this repository to find a simi…
-
This issue is to keep track of the work to support Raviart-Thomas and Nedelec elements in the context of `MatrixFree` and `FEEvaluation`. We need the following steps:
- [ ] We need suitable polynomia…
-
#### Problem:
Currently there is no cost on the 6 splines defining the linear and angular acceleration of the base. There are constraints on the base (range-of-motion, dynamic), but if these constra…
-
## Question
Thank you for this great effort. I was wondering how can one access the values in a ciphertext. For example in CKKS, each cipher text is a pair of polynomials. Is there a way to print the…
-
The method currently used to calculate polynomial greatest common divisor and lowest common multiple involves calculating the roots of the polynomials then using logic to determine the gcd and lcm. Th…
-
## Implementing Automatic Differentiator
This issue tracks the implementation of an automatic differentiator for the expression compiler. The compiler parses expressions into binary trees, and this…
-
"Fast CRC Computation for Generic Polynomials Using PCLMULQDQ Instruction." [a la .NET 8.0](https://devblogs.microsoft.com/dotnet/performance-improvements-in-net-8/).
-
### Problem Description
- Functions for computing the Hamming weight are missing in the classes of Boolean functions and Boolean polynomials, but the Hamming weight is frequently used in the study of…
10v1 updated
7 months ago
-
### Is there an existing issue for this?
- [X] I have searched the existing issues for a bug report that matches the one I want to file, without success.
### Did you read the documentation and troub…
-
To whom it may concern,
I understand that implementing a generic integrate function would be a significant expansion, but a basic method that simply integrated polynomials would be very helpful. I …