Hi Chris, On Fri, Mar 20, 2009 at 1:54 AM, Chris Godsil <[email protected]> wrote: >
<SNIP> > As the Reference Manual suggests, I > entered > M.determinant? to see what algorithm was being used, but did not get > any useful information. For the specified matrix M as defined above in your original email, I entered this sage: M.determinant? in Sage 3.4 and received the following snippet of info: ALGORITHM: For small matrices (n4), this is computed using the naive formula For integral domains, the charpoly is computed (using hessenberg form) Otherwise this is computed using the very stupid expansion by minors stupid *naive generic algorithm*. For matrices over more most rings more sophisticated algorithms can be used. (Type ``A.determinant?`` to see what is done for a specific matrix A.) But I don't think that snippet on algorithm helps in answering your question on the specific (implementation of) algorithms. -- Regards Minh Van Nguyen --~--~---------~--~----~------------~-------~--~----~ 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 URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
