On 2013-12-22, Evgeniy Maevskiy <emaevskiy at e-math.ru> wrote:
> Is it true, that "determinant(M) computes the determinant of M by a
> method similar to Gaussian elimination" ?
Reading the code (src/matrix.lisp), I see that a Gaussian elimination
algorithm (TFGELI0) is employed if ratmx=true, otherwise another
method (TREEDET) is called. Looking at TREEDET, I can't tell what it
is doing, although whatever it is, its run time increases very quickly
with the size of the matrix.
best,
Robert Dodier