Hi there, I was looking at solve_right. And as much as I understand if the system has infinitely many solutions it just generates a random solution (with free vars = 0). Doesn't it make more sense that it gives back a matrix : [C0 C1 C2 ..] such that X = C0 + C1*t1 + C2*t2 + ... be a solution to the system. I mean who needs a random solution?
On the other hand, as much as I dug into to the documents, sage doesn't have a function that take matrix A and columnar vector B and gives the parametric solution for singular systems. I know it's easy to compute using the echelon_form but considering how often it is used, it deserves a dedicated function. And solve_right seems the right function. Also, I saw that 'solve' uses Maxima to solve a linear system. But entering the equations in solve isn't as easy as entering the coefficient matrix. Should I start a ticket on solve_right to behave differently in the case of singular matrices? It will be somehow backward compatible as the first column is a solution to the system. Or should we give it a different name. Cheers, Syd -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
