2009/6/12 evlu...@gmail.com <evlu...@gmail.com>: > > I'm working on some code that is very computationally intensive. I'm > pretty sure my algorithm is good, but I know that tiny differences in > wording in sage can make a huge runtime difference. Is there any site/ > blog/whatever that I could look at to find out what makes for fast > sage code? I figure this is preferable to constantly spamming sage- > support with optimization questions. >
In my experience, if you want to write really fast code using Sage or any other software there is no substitute for putting in the work to deeply understand the algorithms you are using and how they are implemented. Nothing beats reading the source code, etc. If foo is any Sage function one way to get started reading the sources for foo is to type "foo?". Often code in any math software system is far from optimal, and only gets (a lot) faster when somebody decides to build something using that software, and either improves Sage or at the least complains about parts of the software that are two slow -- e.g., yesterday somebody complained to me that determinants of sparse matrices over ZZ in Sage are currently really slow compared to dets of dense matrices, so I'll likely fix this. -- William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
