Laplace's method is, btw, one of the worst ways to compute determinants. It is on a par with using Cramer's rule for solving linear systems.
Much better to do QR and take the product of the diagonal of the R matrix or do the same with the diagonal matrix out of an SVD. Even LU decomposition is better. It is nice to have implementations like this and have people exercise the matrix code, but nobody should actually be using these algorithms for anything serious. On 4/11/08 7:16 AM, "Karl Wettin (JIRA)" <[EMAIL PROTECTED]> wrote: > > [ > https://issues.apache.org/jira/browse/MAHOUT-26?page=com.atlassian.jira.plugin > .system.issuetabpanels:all-tabpanel ] > > Karl Wettin resolved MAHOUT-26. > ------------------------------- > > Resolution: Fixed > > Laplace parts commited in reversion 647148. > > Thanks Sergey! > >> Matrix implementation bug fix and little addition >> ------------------------------------------------- >> >> Key: MAHOUT-26 >> URL: https://issues.apache.org/jira/browse/MAHOUT-26 >> Project: Mahout >> Issue Type: Bug >> Environment: JDK 1.6, IntelliJ Idea 7.0.2 >> Reporter: Sergey Chickin >> Assignee: Karl Wettin >> Attachments: MAHOUT-26.patch, MAHOUT-26a.patch >> >> >> Some bugfixes to matrix multiplication and implementation of recursive >> determinant calculation using Laplace theorem
