Dang. That is fast.
What size matrices was this for? On Thu, May 14, 2009 at 12:09 PM, Luc Maisonobe <luc.maison...@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]. >
