----- Original Message ----- From: "DE" <satan66613@yandex.ru> To: "vicente.botet" <boost@lists.boost.org> Sent: Thursday, May 06, 2010 7:37 PM Subject: Re: [boost] performance of a linear algebra/matrix library
on 06.05.2010 at 21:24 vicente.botet wrote :
Why is it slower? or better where do you spent more time than doing it in C? abstraction penalty i guess i'm going to further dig toward it besides in C you can do it in a very efficient way since it's all about pointer arithmetic
Why you don't use the same pointer arithmetic in C++?
BTW, what m.assign(m1,m2) does (I have not read the C code)? oops... 'm.assign(m1*m2)' of course Aaah!
What about Boost.LA? afaik boost LA concerns statically sized matrices that's not an option for me personally
I though you wanted performances :) have you compared with uBlas? Vicente