It's possible. Probably a better test would be to write a loop in Magma which would modify the matrix in each iteration (say by adding something to one location). This came about because one of my colleagues had a large search program written in Magma in which almost all the computation was done in calls to IsConsistent in the inner loop. Each call was with a different matrix A. I rewrote the program in Sage, and found, much to my chagrin, that it was about a factor of 30 slower. So in that program no caching could have helped.
Victor On May 26, 6:23 pm, Simon King <[email protected]> wrote: > On 26 Mai, 22:09, VictorMiller <[email protected]> wrote: > > > A = Matrix([[1,0,1,0],[1,1,0,1],[0,1,0,1],[1,1,0,0],[1,0,0,0]]) > > b=vector([13,1,7,5,14]) > > timeit('A.solve_right(b,check=False)') > > B = A.change_ring(QQ) > > timeit('B.solve_right(b,check=False)') > > bm = magma(v) > > Am = magma(A.transpose()) # magma uses solve_left > > magma.eval('t :=Cputime();for i in [1..10000] do a,b,c := > > IsConsistent(%s,%s); end for; Cputime()-t;'%(Am.name(),bm.name())) > > Might there be some caching of useful information on Am in Magma? -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
