Well, I ran out of steam (and time) for my foray into Haskell way back in March. I plan on starting a new project soon, one that is a quite a bit more ambitious. I have always learned better `by doing', so I am going to try to implement a Haskell package to compute the Grobner basis of an ideal in a polynomial ring using the multithreaded constructs that are built into Haskell.
Of course, this means that I will have to write a polynomial 'object', and then try to get a multithreaded version of Buchberger's algorithm programmed properly. I think I am going to be looking at Anton Leykin's paper and C++ implementation of a distributed version of Buchberger's algorithm. Wish me luck!
No comments:
Post a Comment