Intel® oneAPI Math Kernel Library
Ask questions and share information with other developers who use Intel® Math Kernel Library.
Announcements
FPGA community forums and blogs have moved to the Altera Community. Existing Intel Community members can sign in with their current credentials.
7234 Discussions

Parallel cluster sparse direct solver on very large matrix

Jason_d_
Beginner
990 Views

Hi there,

We have some C code working for solving a big linear system that is quite sparse using the cluster sparse solver routines in MKL. We generally followed the `cl_solver_unsym_distr_c.c` example code. 

We want to now use this code on an even larger sparse matrix that has over 3 billion non-zero entries (but it is, in fact, sparse). It appears that the cluster sparse solver insists on the number of non-zeros being specified by an MKL_INT, which we are obviously overflowing. Passing in a long instead of an int generates an error.

Is there a solution to this problem? Are we limited to considering matrices with nnz that is bounded by the maximum size of an integer?

Thanks, Jason

 

0 Kudos
1 Solution
Gennady_F_Intel
Moderator
990 Views

Did you link with ILP64 libraries? 

View solution in original post

0 Kudos
2 Replies
Gennady_F_Intel
Moderator
991 Views

Did you link with ILP64 libraries? 

0 Kudos
Jason_d_
Beginner
990 Views

No, but that solved the problem. Thanks, life is better now!

0 Kudos
Reply