commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: [math] Re: commons-math, matrix-toolkits-java and consolidation
Date Thu, 14 May 2009 19:13:01 GMT
Dang.

That is fast.

What size matrices was this for?

On Thu, May 14, 2009 at 12:09 PM, Luc Maisonobe <Luc.Maisonobe@free.fr>wrote:

> Some benchmarks I did a few weeks ago showed the new [math] linear
> package implementation was quite fast and compared very well with native
> fortran libraries for QR decomposition with similar non-blocked
> algorithms. In fact, it was 7 times faster than unoptimized numerical
> recipes, about 2 or 3 times faster than optimized numerical recipes, and
> very slightly (a few percents) faster than optimized lapack with Atlas
> as the BLAS implementation. Faster QR decomposition required changing
> the algorithm so the blocked lapack implementation was the only native
> implementation faster than [math].
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message