solving it fast

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/