As usual, the most general solution is a particular solution plus something from the kernel.
Whats the base ring of the matrix that you are constrcuting? On Friday, June 28, 2013 5:33:59 PM UTC-4, tvn wrote: > > I can convert my data to a matrix M but M.solve_left() will give 0 to > *all* coefficients in my matrix. This is not the results given by solve(), > which is something like c_10 = r1 , c_9 = 2*r1+3 , c_8=r2 , c_1 = 1/2*r2. > I have tried using the reduced row echelon form and M.rref() seems to give > what I want (equiv to the answer from sol(). The problem is that this > method rref() also takes long time, seem to be even longer than calling > solve() itself. > > > On Friday, June 28, 2013 12:45:28 PM UTC-6, Volker Braun wrote: >> >> Don't use the general-purpose solve() for linear equations. Write your >> system of linear equations in matrix form and then use the solve_left() / >> solve_right() method of matrices. Solving something in the order of 200 >> equations should be almost instantaneous. >> >> -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/groups/opt_out.
