Is there any way to find solutions to arbitrary systems of linear equations in Sage? I mean, without using an external package? (is there even an external package with that ability?) I'm not interested in fast computations, just the ability to solve systems would be useful (or wouldn't it be? It seems as though there is not much interest in this...) I believe I could implement it, just by looking at the reduced row echelon form, but I don't think that would be quite efficient, since I really don't know much about efficiency in Matrix computations. Maybe write it in Python and include it in Sympy until something better gets done? I'm looking forward to ideas.
Fabio --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
