Alexander Demin
Alexander Demin
Hi, we found the issue, it's a bug in Groebner.jl; I'll publish the fixed Groebner.jl version tomorrow
Hi, yeah Groebner can do this (fast ?). Say, `x = sin(a)`, `y = cos(b)`, `z = sin(b)`. For simplifying `S = -x - y^2*x - z^2*x` with `y^2 +...
```julia @variables x y z system = [ x + y + z, x*y + x*z + y*z, x*y*z - 1 ] sol = solve(system) 6 solutions, 0 are real...
Speaking in terms of desirable interface, I think it would be cool to have something like this: ---- ### For systems that have finitely many solutions In this case we...
> I don't understand, how can rationalizing coefficients turn the problem into something only numerical? Could you give an example? If we do say `solve(x^2 - 0.25)` , coefficient `0.25`...
Just a small update, I added the `roots` function. Currently, it only solves single polynomials in one variable, e.g. ```julia @variables a b c x Symbolics.roots(a*x^2 + b*x + a*b*c,...
Thanks for this summary @ChrisRackauckas ! We will try to update MTK in StructuralIdentifiability.jl
_cf._ https://github.com/JuliaLang/julia/blob/16e61e25c7e15280b1e3c11b549b410e324175c4/stdlib/Logging/src/ConsoleLogger.jl#L60
> Your problem is that you don't release the allocated arrays, and thus end up allocating a quite bit out of the buffer. But that is precisely the point !
Thanks for your answer, sorry for being not clear, let me explain. My example is purposefully inefficient. In my original problem, releasing intermediate arrays cannot be done easily. The allocation...