From: Yu Ichino <noagony@...>
Date: 2010-02-21T11:08:19+09:00
Subject: [ruby-core:28274] Re: [Feature #2772] Matrix: Calculating determinant using Bareiss 	algorithm [patch]

Dear Marc and everyone,

It is great relief to see my request had a kind response.
My gratitude goes to pains you took, Marc!
Thank you for peering through the algorithm and revising it up to the
library level.

After my initial post,
I came to conclude that the slower performance in the Float case
is due to additional multiplication a[k][k]*a[i][j]
and is unavoidable.
Am I correct?

If so,
you better keep the original algorithm for Float matrix
(still I don't get the reason of many swap operations)
and use Bareiss only for Integer one.
It depends on the library policy of which I am completely ignorant.
(Matrix#determinant might be the only interface users want to see)

See you,
Yu