Re: solving it fast

Well,
grats!



How about using MKL ( intel's tuned lapack ).
In Matrix*Matrix  it is fast (the code is it SEM ? ).
so might be in :
SparseMatrix * Vector 

Is it possible to build a matrix object that will use
some well (vendor) tuned procedures instead of
standard mtl when multiplying SM * V in bccg ?

( or ... write own bccg ? )
please inform me if any.
Soon I will have same problems.

Regards
JO



--- Michael Nielsen <[email protected]> wrote:
> I've implemented a finite element solver using cg()
> in the ITL framework. I 
> expected it to be a bit faster, it's only as fast as
> my "head on" 
> implementation i did. I've pretty much done it like
> in the example for 
> conjugate gradient on the homepage, using these
> types:
> 
> typedef dense1D<float> vector;
> 
> typedef matrix<float, symmetric<upper>,
> compressed<>, row_major>::type 
> sparseSymmetricMatrix;
> 
> 
> 
> Is it the fastest way using ITL?
> 
> 
> 
> /Michael
> 
> 
> 
> 
> _______________________________________________
> This list is archived at
> http://www.osl.iu.edu/MailArchives/mtl-devel/
> dear 

________________________________________________________________________
Yahoo! Messenger - Communicate instantly..."Ping" 
your friends today! Download Messenger Now 
http://uk.messenger.yahoo.com/download/index.html
_______________________________________________
This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/