On 3/21/07, Robert Bradshaw <[EMAIL PROTECTED]> wrote: > I agree with Kyle that small cases should default to the naive > algorithm, 2x2 at least, especially if working in the fraction field > is expensive in comparison. Should I change this?
Yes, definitely. I think the generic Hessenberg form algorithm in SAGE should be asymptotically faster than expansion by minors, since its complexity is O(n^4) field operations instead of O(n!) field operations. But for small n other methods are faster. -- William --~--~---------~--~----~------------~-------~--~----~ 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
