I have a matrix that is composed of multivariant polynomial entries. I want to compute its determinant. The problem is that it is very slow or runs out of memory. For example, R.<x,y> = QQ[] C = random_matrix(R,10,10) Cdet = C.determinant() # this line takes a long time
If you have more variables, it will run out of memory instead (on a 32 bit installation). Is there a more efficient way to do this? Would using symbolic expressions then coercing back to the polynomial ring be better? Thanks --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
