topic Hi Stephen, in Intel® oneAPI Math Kernel Library

FEAST Mathematica

Stephen_S_2 — Wed, 16 Sep 2015 22:46:14 GMT

Hi,

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?

Thanks,

Stephen

HI,

Alexander_K_Intel2 — Thu, 17 Sep 2015 00:00:32 GMT

HI,

Have you change portrait or only nonzero values in portrait?

Thanks,

Alex

I'm not sure what you mean by

Stephen_S_2 — Thu, 17 Sep 2015 00:06:27 GMT

I'm not sure what you mean by portrait. If you mean the search interval, then I did not change it, but both cases return the same number of eigenvalues (around 50). I set the subspace size to 100. The interval includes 0.

Thanks,

Stephen

Hi Stephen,

Alexander_K_Intel2 — Thu, 17 Sep 2015 04:03:16 GMT

Hi Stephen,

By changing protrait i mean changing ia and ja arrays. Or you change only values of matrix?

Thanks,

Alex

Alex,

Stephen_S_2 — Thu, 17 Sep 2015 13:33:53 GMT

Alex,

I changed the values only. In fact, the magnitudes are even the same. I am only multiplying some entries by a complex phase.

Thanks,

Stephen

Hallo,

Matthias_B_Intel — Fri, 09 Nov 2018 10:31:13 GMT

Hallo,

i just installed Mathematica11 to run FEAST as well - but I cannot find the correct license server.
Could someone please share URL?

Thanks in advance.

Regards Matthias