-
After https://github.com/google/heir/issues/256, the polynomial dialect is now upstream. The remaining work is to upstream the passes
- convert-polynomial-mul-to-ntt
- polynomial-to-standard
Sh…
j2kun updated
5 months ago
-
### Steps To Reproduce
1. Fedora 39. SageMath version 10.3.
2. Run:
sage: p. = CDF[]
sage: q = x^2+y^2+z^2-1
sage: p(1).quo_rem(q)
TypeError: Singular error:
? division(`number`,`poly`) fail…
-
I think it is Chebyshev polynomial of first kind
https://en.wikipedia.org/wiki/Chebyshev_polynomials
need correction of implemtation
 = x (0.5 + 0.5 sgn(x))`, this reduces to approximating the sign function, and this paper appears to have the state of the art: https://eprint.iacr.org/2020/834
Also note
- `…
j2kun updated
2 weeks ago
-
I noticed that the functions gcd (Greatest Common Divisor) and lcm (Least Common Multiple) found in Functions - Number Theory , won't accept and input with only 2 variables although the UI says the th…
-
**Describe the solution you'd like**
`ulab` already has `polyfit()`, but not `Polynomial`.
I would like to see `Polynomial` implementing `Polynomial.fit()` and `Polynomial.roots()`, as well as `Po…
-
### Steps To Reproduce
_No response_
### Expected Behavior
`RealIntervalAbsoluteField` looks like a valid class for building polynomials on top of it.
### Actual Behavior
However, an error appear…
-
In the grand scheme of boosting performance by making the whole RHS of the Ribasim ODE problem C1 smooth, doing this for `TabulatedRatingCurve` is one of the steps. Currently the $Q(h)$ relation is gi…