H. Arponen's profile - activity

(I have a feeling this will be trivial, but maybe others have come across this too)

So I'm just testing desolve with this equation:

de = a*diff(x*f) + .5*sigma*diff(f,x,2)

and if I specify the initial conditions in desolve like this

h = desolve(de, f, ics = [-Infinity, 0., Infinity, 0.])

... and I get h=0. Huh?? I couldn't find practically anything on how Sage handles BC at infinities...

Hi! Could someone elaborate on the status of the simplification routines in SAGE? I've noticed that the simplify_full can't exactly be said to compete with e.g. mathematica's corresponding FullSimplify...

I don't know if the simplify functions operate as replacement rules or such, but if they do, I might be able to contribute in the development (I'm not much of a programmer though).

So could someone please explain about how simplify_full and other simplification functions work, and how I and others can participate? This post could work as an info for all who want to take part!

I'd like to try to resurrect this issue, if possible. Similarly to Xaver, I had high hopes for SAGE, but when comparing different symbolic simplification functions, I've come to realize the superiority of MMA's FullSimplify. I don't think there's any program/function that can even come close to that... anyway, is something like that under development by SAGE members? I'd like to perhaps take part, although I'm probably not qualified... I have some experience with functional programming in mma though. It would be great to be able to completely migrate to SAGE! :)

I'd like to try to resurrect this issue, if possible. Similarly to Xaver, I had high hopes for SAGE, but when comparing different symbolic simplification functions, I've come to realize the superiority of MMA's FullSimplify. I don't think there's any program/function that can even come close to that...