On 4-Jun-09, at 2:46 PM, Jason Grout wrote:
> > If I were to attempt to add LU decomposition to general matrices in > Sage, where would I start? I could write a naive algorithm, but I > also > found an implementation in linbox. I suppose there might be an > implementation in other libraries we include. > > 1. Is wrapping linbox likely the best option? How about for only some > rings? If so, which rings (QQ, ZZ, Integers(p)?)? > > 2. Is writing a naive implementation the best option? I would definitely start by writing a naive implementation, setting down the interface and return types, etc. Presumably linbox will never handle CIF, for example, so this is almost always necessary. Nick --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
