PARDISO: ERROR during symbolic factorization: -3 (reordering problem)?

[SAL_AHM]

Hello,

I am using the pardiso direct solver to solve the system of equation obtained from finite element method applied on nonlinear PDE. I will solve my problem for high number of matrix size (small mesh size) but now I discus only small number of size to fixed the code problems.

My data is in CRS (or CSR)  defined in three vectors _id, _ik, _sk and right hand side in vector f. I applying the copy command to transform its into array as:

MKL_INT n = f.size();

MKL_INT nnz = _sk.size();

MKL_INT m = _id.size();
 ia[m];
copy(_id.begin(), _id.end(), ia);
MKL_INT ja[nnz];
copy(_ik.begin(), _ik.end(), ja);
double a[nnz];
copy(_sk.begin(), _sk.end(), a);

When I run the code it gives the error:

"*** Error in PARDISO  (        reordering_phase) error_num= -180
*** error PARDISO: reordering, symbolic factorization

=== PARDISO: solving a real nonsymmetric system ===
1-based array indexing is turned ON
PARDISO double precision computation is turned ON
User provided fill-in reducing permutation is turned ON


Summary: ( reordering phase )
================

Times:
======
Time spent in calculations of symmetric matrix portrait (fulladj): 0.000040 s
Time spent in reordering of the initial matrix (reorder)         : 0.000000 s
Time spent in symbolic factorization (symbfct)                   : 0.000705 s
Time spent in allocation of internal data structures (malloc)    : 0.000367 s
Time spent in matching/scaling                                   : 0.000001 s
Time spent in additional calculations                            : 0.000042 s
Total time spent                                                 : 0.001155 s

Statistics:
===========
Parallel Direct Factorization is running on 48 OpenMP

< Linear system Ax = b >
             number of equations:           95
             number of non-zeros in A:      2364
             number of non-zeros in A (%): 26.193906

             number of right-hand sides:    1

< Factors L and U >
             number of columns for each panel: 128
             number of independent subgraphs:  0
< Preprocessing with input permutation >
             number of supernodes:                    51
             size of largest supernode:               45
             number of non-zeros in L:                2077
             number of non-zeros in U:                88
             number of non-zeros in L+U:              2165
Salman Ahmad: 4

ERROR during symbolic factorization: -3make: *** [../ICC_default.mk:78: run] Error 1"
 

I noted one point, my number of nonzero is 2365 but here "number of non-zeros in A:      2364"

For code to past here for this specific example, n= 95, m = 96, nnz = 2365 and

ia[m] = {values printed from ia};

ja[nnz] = {values printed from ja};

a[nnz] = {values printed from a};

b[m] = {values printed from b};

The code is in the attachment, please any suggestion to solve this problem!

[VarshaS_Intel]

Hi,

Thanks for posting in Intel Communities.

Could you please let us know the OS details(linux/windows/macOS) and Intel oneAPI version you are using?

And also, Could you please let us know the compilation options/ interface being used so that we could investigate more?

Thanks & Regards,

Varsha

[SAL_AHM]

Hi,

My OS is linux  and oneAPI version is 2023.0.0.

I am trying on icpc, also try icpx but still error.

[VarshaS_Intel · Accepted solution]

Hi,

Thanks for the details.

Please find the modified attached zip file with code(code.txt) where we are able to get the results without any errors. Also, I have attached the results of the code(result.txt)

And, also you can find examples of the PARDISO in the following path (/opt/intel/oneapi/mkl/latest/examples/c/sparse_directsolvers/source)

Could you please try and let us know if you facing any errors?

Thanks & Regards,

Varsha

[VarshaS_Intel]

Hi,

Glad to know that your issue is resolved. Thanks for accepting our solution. This thread will no longer be monitored by Intel. If you need additional information, please start a new question.

Thanks & Regards,

Varsha