Intel® Math Kernel Library

FEAST Mathematica


I am running the FEAST algorithm on Mathematica/10.0.  I have sparse matrices of dimension around 500,000, looking for around 50 eigenvalues.  I have noticed the runtime depends massively on what the entries are.

For instance, if I have two sparse matrices with precisely the same non-zero entries, I just modify them slightly, the runtime can slow down 5x or more.  The specified intervals are the same and the results return very nearly the same number of eigenvalues.

Is this a known issue with FEAST? 



different results for LAPACKE_dgels between MKL and LAPACKE

Hi guys,

I wrote some code to do dgels originally using LAPACKE. I also tried to use MKL to do the dgels. From my understanding, with the exact same code base but just recompile/relink with MKL library would just do the job. Or can also work upon the test program built with LAPACKE. the programs run OK, but the final results are different.

Any one can tell me why? 

Below is the the test program source code as well as the MakeFile lines.


What is the memory management strategy in sparse_matrix_t ?

Hi all,

I have two questions about memory management of sparse_matrix_t :

1. When I create a matrix handle using routine mkl_sparse_?_create_csr, the handle will copy all data to new memory blocks? Or it only save the pointers in handle?  If it copy all data to new block, and the routine mkl_sparse_destroy will free these memory blocks or not ?

Memory issue on multithreaded application using threaded Intel MKL

Hi everybody!

I have got an issue using Intel MKL on a multithreaded application. I am using MKL 10.3.10 and POCO 1.6.1 on Visual Studio 2010, Windows 7 Professional, Intel Core i7-3770 CPU @ 3.40 GHz, 6 Gb RAM.

Basically a class method is called iterativelly, this method launches on a POCO thread another method of the same class to compute a matrix-matrix multiplication via sgemm. This processing class is build as a static library; here's the header code

Assine o Intel® Math Kernel Library