2021-11-16 09:02:29 +0100 | received badge | ● Good Question (source) |

2016-11-30 00:50:06 +0100 | received badge | ● Famous Question (source) |

2016-11-30 00:50:06 +0100 | received badge | ● Popular Question (source) |

2016-11-30 00:50:06 +0100 | received badge | ● Notable Question (source) |

2015-01-27 17:45:50 +0100 | received badge | ● Famous Question (source) |

2014-10-06 20:28:42 +0100 | asked a question | Boundary conditions at infinity with dsolve (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: and if I specify the initial conditions in desolve like this ... and I get h=0. Huh?? I couldn't find practically anything on how Sage handles BC at infinities... |

2013-06-10 22:20:27 +0100 | received badge | ● Notable Question (source) |

2012-11-23 10:31:20 +0100 | received badge | ● Nice Question (source) |

2012-11-21 03:27:38 +0100 | received badge | ● Popular Question (source) |

2012-01-31 17:37:20 +0100 | received badge | ● Student (source) |

2012-01-31 14:49:42 +0100 | received badge | ● Supporter (source) |

2012-01-31 11:03:17 +0100 | asked a question | simplify_full development 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! |

2012-01-08 11:20:57 +0100 | commented answer | full simplify, sage vs mathematica 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! :) |

2012-01-08 11:20:57 +0100 | commented answer | full simplify, sage vs mathematica 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... |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.