Thread Subject: speed of matlab sparse against c++ sparse librariers

Hi,

I need to have a very solver for my FEM software.
For prototyping I've written all code in MATLAB and it's already quiet fast, however I want to have more performance.

Now I consider rewriting the solver in C++ with sparse matrix libraries as MTL.
Therefore I wondered what the performance gain of using a C++ sparse library over MATLAB would be. Will it be about the same, twice as fast etc.?

I'm just interested in performing some sparse matrix multiplications (nxn with n~30 000) and solve the system with preconditioned conjugate gradients. I'm not worried about the assembly of the FEM matrices.

Thanks a lot