Re: [boost] performance of a linear algebra/matrix library

Subject: Re: [boost] performance of a linear algebra/matrix library
From: vicente.botet (vicente.botet_at_[hidden])
Date: 2010-05-06 13:44:45

----- Original Message ----- 
From: "DE" <satan66613_at_[hidden]>
To: "vicente.botet" <boost_at_[hidden]>
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