-
The benefit is then you get a speed up from FastPolynomialRoots.jl.
There may be a slowdown for the roots command. If the issue
https://github.com/JuliaMath/Polynomials.jl/issues/130
goes …
-
### What is wrong?
If I read the current implementation of `FQP.__eq__` correctly, it returns `True` for this test:
```py
FQP([1, 2, 3], ...) == FQP([1, 2], ...)
```
which seems wrong.
In …
-
Test it on games that have verifiable mixed strategy equilibria.
It currently seems to always return empty sets for some reason, even though I’ve printed the polynomials to verify that they’re cor…
-
For even/odd functions using the respective type of polynomial typically allows for much higher degree approximations. Would it be relatively easy to add the ability to generate a minimax polynomial w…
-
Would really love your feedback: https://github.com/1ssb/torchkan
Using Legendre Polynomials instead; ~98% on MNIST.
1ssb updated
6 months ago
-
With either TypedPolynomials or DynamicPolynomials:
```julia
julia> using TypedPolynomials
julia> @polyvar x
x
julia> coefficient_type(x + one(Bool)) # should be `Bool`
Int64
julia> co…
-
We can consider that `q_arith` is hierarchically at a higher level.
`q_l, q_r, q_c, q_m, q_o, q_4` could be considered wire selectors in arithmetic gates, and auxiliary values in other custom gates.…
-
It seems that the exponentiation of polynomials (in Poly form or as Expr) could be improved by using a recursive calculation (see [presentation of J.C.P. Miller's algorithm](https://www.researchgate.n…
-
# Towards a new SymPy: part 2 - Polynomials — blog documentation
[https://oscarbenjamin.github.io/blog/czi/post2.html](https://oscarbenjamin.github.io/blog/czi/post2.html)
-
Li2020 contains a fairly up to date set of numerical methods for fractional derivatives and integrals.
It would be very cool to implement most of this and compare.
- Chapter 3: Riemann-Liouville q…