-
For any values of k or n greater than 2 the fastest algorithm is probably to simply use a hash-table which would be amortized O(n). But the answer given suggests doing a O(n^k) grid search which (in m…
-
Right now it appears that reprojecting by interpolation is _only_ available as polynomial interpolation. Is that an intended restriction? For example, I would love to see Lanczos resampling (due to …
-
Occuring when the routine deals with the continuum analysis:
```
--OBS_DIR: /data/spirou4/apero-data/offline/red/23BQ01-Aug09
19:04:20.672-**|POLAR[11892]| --EXPOSURES[0]: [TELLU_OBJ] 2890757o…
-
Currently Cryptol has built-in polynomial arithmetic functions like pmult, pmod, and pdiv. However, pmult is restricted to polynomials with Bit coefficients. It would nice if Cryptol supported _optimi…
-
The code for this lives in the simplify package, in
- [ ] sparse-gcd.scm
- [ ] sparse-interpolate.scm
Candidates:
- [ ] "A Fast Parallel Sparse Polynomial GCD Algorithm" http://www.cecm.sfu…
-
This is a spinoff from [#14239 comment:13](https://github.com/sagemath/sage/issues/14239#comment:13). There I noticed that for a large symbolic expressions `b`, the call `b.minpoly()` was a lot (by …
-
As discussed at the Hecke/Nemo/Flint workshop, there is a plan to add support for lattices of compatibly embedded finite fields to Nemo/Flint. This issue tracks progress on the subject.
On the Flin…
defeo updated
7 years ago
-
I have a system of polynomials of some moderate size that needs solving, i.e. find all roots. It would be in 2 or 3 variables (i.e. $x, y, z$) with orders of 2, 4, 16 (probably not higher).
Can thi…
-
### Describe the algorithm/code
This is a method in mathematics that is used to find the roots of a polynomial equation.
I want to add an implementation of this method in python.
### Do you want to…
-
The following ideal is passed to Singular after expansion of the coefficient field of the principal ideal
generated by [this irreducible polynomial](https://github.com/oscar-system/Oscar.jl/files/15…