-
# Synopsis
Create tools to convert between a multi-file representation of the database and a single-file representation. Ensure they can round-trip, including after a WRITE SOURCE from metamath.exe.…
-
It would be useful to have a method to calculate the real roots of small polynomials. This should be pretty straightforward for order up to 3. I need this for polynomials of Rational or Double, but ma…
-
Some ideas from MPSolve (which is way, way faster):
- Choose initial values intelligently
- Use the Aberth method instead of Durand-Kerner
- Use the secular equation
- Use doubles (with hacks to avoid…
-
### Background and motivation
There are many variants of CRC32 algorithm that differ only in polynomials used. The current implementation only supports IEEE 802.3 polynomial externally. It would be…
-
This should take formula, calculate polynomials then generate multipliers for specific variables.
-
It is "finding small integer roots of a bivariate polynomial modulo an integer", however there is no way to specify this integer. Only polynomials over Z (not Z/mZ) are supported.
-
It's not true that a polynomial is a unit in its polynomial ring iff its constant coefficient is a unit. This has been assumed in the current implementation. For example, it isn't true over Z/nZ.
A…
-
By implementing spherical harmonics using the [legendre polynomials recurrence formula](https://en.wikipedia.org/wiki/Associated_Legendre_polynomials#Recurrence_formula), the speed of the wave functi…
-
Hi Jonathan：
It has been a long time since the last question. I have got a problem recently. When there are only enough data for the input variables (more than 1 dimension), how can I compute the …
-
I think we can do any star like geometry as long as we can do the boundary: consider it as
```julia
p(x/z,y/z) = 1
```
for `z = 0..1` (disk being classic example). Then we can construct OPs in 3-v…