# Pardiso - phase 11 errors **URL:** \ **Category:** Intel® oneAPI Math Kernel Library\ **Created:** [November 13, 2013, 1:02pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898 "2013-11-13T13:02:08Z")\ **Posts on this page:** 10\ **Page:** 2
**Author:** ![Alexander\_K\_Intel2](https://avatars.discourse-cdn.com/v4/letter/a/00C7FD/32.png) [@Alexander\_K\_Intel2](https://community.intel.com/u/Alexander_K_Intel2)\ **Post date:** [November 15, 2013, 6:45pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/21 "2013-11-15T18:45:24Z")
Hi Jared, Sorry for skipping answer, will check your example during holidays, ok? Thanks, Alex ---
**Author:** ![Jared\_W](https://avatars.discourse-cdn.com/v4/letter/j/0061B3/32.png) [@Jared\_W](https://community.intel.com/u/Jared_W)\ **Post date:** [November 15, 2013, 9:14pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/22 "2013-11-15T21:14:03Z")
Thanks for keeping up on it Alexander, I’ll do the same in the mean time! Let me know what you think when you get the chance. ---
**Author:** ![Alexander\_K\_Intel2](https://avatars.discourse-cdn.com/v4/letter/a/00C7FD/32.png) [@Alexander\_K\_Intel2](https://community.intel.com/u/Alexander_K_Intel2)\ **Post date:** [November 19, 2013, 1:37pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/23 "2013-11-19T13:37:17Z")
Hi Jared, Here i am… But i have a problem with your code, can we made him a bit clear? I have a problem with matJacbn and with undefine init variables (n, c, dOF)… Can you add this part of file? Thanks, Alex ---
**Author:** ![Jared\_W](https://avatars.discourse-cdn.com/v4/letter/j/0061B3/32.png) [@Jared\_W](https://community.intel.com/u/Jared_W)\ **Post date:** [November 19, 2013, 6:00pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/24 "2013-11-19T18:00:14Z")
Alexander Welcome back! Sorry about the insufficient info. I have updated the code and attached the arrays so you can verify that this is what the code should put together. In the code I have declared **fjac (dimension n\*n)** I get this array from the djacobi routine and it calculates the jacobian of my function and shoves it into the **fjac** array stacking colums, and I have also printed all the values for it into a text file. As long as this can be read in, the rest of the arrays will fill the exact same as I have in the full code. Also I have fixed and declared **n, c, dOF** , and **matJacbn** and these are meant to be used as follows: - **matJacbn** is a **2D vector (n X n) “matrix”** which gets its values from **fjac** where each column is filled consecutively - **c** is a counter for the number of non-zero elements in **matJacbn** which i then use to set the length of **a** and **ja**. - **n** and **dOF** are the same they represent the **degrees of freedom** , also **number of equations**. Hopefully this all makes sense, I have attached the new code. Please ignore the old code. Again thanks for all your help with this hopefully it will come together soon. [fjac-array.txt](https://community.intel.com/uploads/short-url/dIz4YrcmTx8Dx9Zxaxvp5GaSTia.txt) (655 KB) [ja.txt](https://community.intel.com/uploads/short-url/bYy8JRKDUQIEeLSq1LpDfbNIl6Q.txt) (22.1 KB) [ia.txt](https://community.intel.com/uploads/short-url/2QEMLoVp42AJK7Y4MPG5R7HqNX9.txt) (2.6 KB) [a.txt](https://community.intel.com/uploads/short-url/nLK3ujDX99UaSbTiCEELfLultFH.txt) (51.7 KB) [pardiso-phase11-code.txt](https://community.intel.com/uploads/short-url/nTiilIMdByeHAX7CdoI1POoCjCT.txt) (5.07 KB) [jacobian-matrix.txt](https://community.intel.com/uploads/short-url/wc0VRTt2zAKRMWrcJGjQlPJoaLN.txt) (451 KB) ---
**Author:** ![Jared\_W](https://avatars.discourse-cdn.com/v4/letter/j/0061B3/32.png) [@Jared\_W](https://community.intel.com/u/Jared_W)\ **Post date:** [November 26, 2013, 5:42pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/25 "2013-11-26T17:42:00Z")
Alright I believe I have a few more things figured out now, but I am getting stuck at this point. Basically looking at A\*x = b where A is an unsymmetric square matrix, x is the solution vector, and b is my rhs. I have set the phase to 331 as outlined by the reference manual for separate forward and backward substitutions to solve A\*x = b. The a, ja, and ia I have automatically built from the mkl\_ddnscsr(job, &m, &n, adns, &lda, a, ja, ia, &info). So I believe I cant be screwing these up, and everything but one issue looks fine on them. The issue is the ia array generated. the last entry is the number of non zeros, but in pardiso the reference manual says the last entry should be equal to the number of nonzeros + 1 which in my case would make it 3702. Other than this I cannot figure out why pardiso will not work and why I am getting this error. nnz(number of non-zeros) = 3701 neqns\_in = 459 ia(neqns\_in)-1 = 3700 \*\*\* Error in PARDISO  ( sequence\_ido,parameters) error\_num= 8 \*\*\* Input check: ia[neqns]\_new -1 \_old -1 are incompatible \*\*\* Input parameters: inconsistent error= 8 max\_fac\_store\_in: 1           matrix\_number\_in : 1 matrix\_type\_in   : 11           ido\_in           : 331 neqns\_in         : 459           ia[neqns\_in]-1   : -1 nb\_in            : 1 I have attached my pardiso parameters and the call to it. [pardiso-code.txt](https://community.intel.com/uploads/short-url/og8ZnqiZKeZYsYFOUjGOLpskQh8.txt) (774 Bytes) ---
**Author:** ![Alexander\_K\_Intel2](https://avatars.discourse-cdn.com/v4/letter/a/00C7FD/32.png) [@Alexander\_K\_Intel2](https://community.intel.com/u/Alexander_K_Intel2)\ **Post date:** [November 26, 2013, 6:22pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/26 "2013-11-26T18:22:02Z")
Hi, Such situation can arrange if zero based mixed with one based. Last element of ia is equal to number of nonzero elements in case of zero based numbering and number of nonzero elements + 1 in case of 1 based format. As i can see you set iparm[34] to 1 before pardiso, what about job[1] before mkl\_ddnscsr. Also, i see that you set iparm[34] to 1 before solving step of pardiso, but if you set it to zero before reordering on all other step pardiso use 1-based indexing and it can not be change. Thanks, Alex ---
**Author:** ![Jared\_W](https://avatars.discourse-cdn.com/v4/letter/j/0061B3/32.png) [@Jared\_W](https://community.intel.com/u/Jared_W)\ **Post date:** [November 26, 2013, 7:12pm UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/27 "2013-11-26T19:12:36Z")
Alexander Okay so I think I understand that I cannot skip directly to phase 331 without doing any previous phases. I think I am just confused on which phases to actually do to solve my problem. I just did phase 22 and I got the following output any idea how I decipher this? Is there a page in the manual that talks about understanding the output? neqns\_in = 459 ia(neqns\_in)-1 = 3700 \*\*\* Error in PARDISO  ( sequence\_ido,parameters) error\_num= 100000 \*\*\* Error in PARDISO: clean impossible (ido?) ================  PARDISO: solving a real nonsymmetric system  ================ Summary PARDISO: ( factorize to factorize ) ================ Times: ====== Time spent in additional calculations                           : 0.006919 s Total time spent                                                : 0.006919 s Statistics: ===========  \< Parallel Direct Factorization with #processors: \>         2  \< Numerical Factorization with BLAS3 and O(n) synchronization \> \< Linear system Ax = b\>              #equations:                                   459              #non-zeros in A:                              3701              non-zeros in A ():                            1.756684 #right-hand sides:                            1 \< Factors L and U \> \< Preprocessing with multiple minimum degree, tree height \> \< Reduction for efficient parallel factorization \>              #columns for each panel:                      96              #independent subgraphs:                       0              #supernodes:                                  0              size of largest supernode:                    0              number of nonzeros in L                       0              number of nonzeros in U                       0              number of nonzeros in L+U                     0              gflop   for the numerical factorization:        0.000000 ---
**Author:** ![Alexander\_K\_Intel2](https://avatars.discourse-cdn.com/v4/letter/a/00C7FD/32.png) [@Alexander\_K\_Intel2](https://community.intel.com/u/Alexander_K_Intel2)\ **Post date:** [November 27, 2013, 12:26am UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/28 "2013-11-27T00:26:04Z")
Hi, Have you done also phase 11? Thanks, Alex ---
**Author:** ![Ying\_H\_Intel](https://avatars.discourse-cdn.com/v4/letter/y/276EF2/32.png) [@Ying\_H\_Intel](https://community.intel.com/u/Ying_H_Intel)\ **Post date:** [June 18, 2014, 7:09am UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/29 "2014-06-18T07:09:00Z")
Hi Jared, I found your issue is open and we have same issue in [https://software.intel.com/en-us/forums/topic/516336](https://software.intel.com/en-us/forums/topic/516336) So i did investigate your issues with your matrix, ia.txt, ja.txt and a.txt. get some result.  I believe you have fixed the problem by call mkl\_ddnscsr (job, &n, &n, adns, &n, a, ja, ia, &info); but still share what i have. **There are two key points with the errors (** other is about the  Jacobin matrix has the zero rows) **1. zero based CSR format** ( you set iparm[34] = 1; /\* = 1 for zero-based indexing; = 0 for one-based indexing \*/1,  // PARDISO: use C-style indexing for ia and ja arrays.) The basic rule is that Last element of ia is equal to number of nonzero elements in case of zero based numbering and number of nonzero elements + 1 in case of 1 based format. For example, you has 459 equation, and  4746 nonzero elements, so the ia[459]=4746, not 4747.  so with  the ia.txt and phase 11 pardiso, you will get the error . val: 0.020833 ia: 4739 /t ia[n+1]: 4747 \*\*\* Error in PARDISO  (incorrect input matrix  ) error\_num= 22 \*\*\* Input check: i=4746, ja\*=-33686019, neqns=458 are incompatible\* If change the ia[459] = 4746, the phase 11 will pass. . **2. ignore the phase steps..  (the last steps).** For example, if  just call Phase 331 no Phase 1 and Phase 2.  one will get the error as below val: 0.020833 ia: 4739 /t ia[n+1]: 4747 \*\*\* Error in PARDISO  ( sequence\_ido,parameters) error\_num= 8 \*\*\* Input check: ia[neqns]\_new -1 \_old -1 are incompatible \*\*\* Input parameters: inconsistent error= 8 max\_fac\_store\_in: 1           matrix\_number\_in: 1 matrix\_type\_in: 11           ido\_in          : 331 neqns\_in      : 459           ia[neqns\_in]-1  : -1 nb\_in         : 1 • Phase 1: Fill-reduction analysis and symbolic factorization • Phase 2: Numerical factorization • Phase 3: Forward and Backward solve including optional iterative refinement I attached the C code.   One can comment the steps and code ia=4746 to reproduce the errors. Thanks Ying ---
**Author:** ![Ying\_H\_Intel](https://avatars.discourse-cdn.com/v4/letter/y/276EF2/32.png) [@Ying\_H\_Intel](https://community.intel.com/u/Ying_H_Intel)\ **Post date:** [June 18, 2014, 7:12am UTC](https://community.intel.com/t/pardiso-phase-11-errors/73898/30 "2014-06-18T07:12:47Z")
attach the file ! [pardiso\_11.cpp](https://community.intel.com/uploads/short-url/dqkXmKXOH3iK4cMmhomlprTLIfj.cpp) (4.09 KB) [Previous page](https://community.intel.com/t/pardiso-phase-11-errors/73898.md?page=1)