From: Anders P. <an...@op...> - 2009-04-16 06:30:24
|
Worked hard on improving performance on BasicMatrix operations (which means I had to optimise everything else). What I measure is how much faster/slower PrimitiveMatrix is compared to JamaMatrix, and the same correspondingly for decompositions. If "primitive" on an average used to be (v25) 5% to 10% faster than "jama", it is now roughly 25% faster. With decompositions the main improvements seem to be where "primitive" were already performing very well. The QR and SingularValue decompositions used to be 12 and 8 times faster than "jama" on tall matrices. Now they are 15 and 11 times faster. Try it yourself! /Anders On 15 apr 2009, at 16.57, Anders Peterson wrote: > v27 has been released. > > http://ojalgo.org/change_log.html > > /Anders > > ------------------------------------------------------------------------------ > This SF.net email is sponsored by: > High Quality Requirements in a Collaborative Environment. > Download a free trial of Rational Requirements Composer Now! > http://p.sf.net/sfu/www-ibm-com > _______________________________________________ > ojAlgo-user mailing list > ojA...@li... > https://lists.sourceforge.net/lists/listinfo/ojalgo-user |