<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: pardiso returns error code -1 in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-returns-error-code-1/m-p/1664961#M36930</link>
    <description>&lt;P&gt;Ok, found the solution myself, maybe helping others:&lt;/P&gt;&lt;P&gt;In the installation of oneAPI in step 3 (integrate with IDE) integrate with Visual Studio 2022 and then in the project properties -&amp;gt; Configuration Properties you see "Intel(R) Libraries for oneAPI", where you can select "Use oneMKL", set this to eg parallel.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Then all works fine.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;best regards,&lt;/P&gt;&lt;P&gt;Philip&lt;/P&gt;</description>
    <pubDate>Tue, 11 Feb 2025 11:51:15 GMT</pubDate>
    <dc:creator>PhilipS1</dc:creator>
    <dc:date>2025-02-11T11:51:15Z</dc:date>
    <item>
      <title>pardiso returns error code -1</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-returns-error-code-1/m-p/1664610#M36926</link>
      <description>&lt;P&gt;Hi there,&lt;/P&gt;&lt;P&gt;I moved from imkl compiled with VS 2015 toolset V140 to oneAPI 2025.0 compiled on VS 2022 toolset V143, all C++, and now get consistently&amp;nbsp; error code -1 (input inconsistent) using the same matrix-vector systems as before.&lt;/P&gt;&lt;P&gt;Here's a small example taken from&amp;nbsp;pardiso_unsym.c that now goes wrong (just up to symbolic fact phase, that's where things already go wrong =&amp;gt; error code -1):&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;/* Matrix data. */&lt;BR /&gt;MKL_INT n = 5;&lt;BR /&gt;MKL_INT ia[6] = { 1, 4, 6, 9, 12, 14 };&lt;BR /&gt;MKL_INT ja[13] =&lt;BR /&gt;{ 1, 2, 4,&lt;BR /&gt;1, 2,&lt;BR /&gt;3, 4, 5,&lt;BR /&gt;1, 3, 4,&lt;BR /&gt;2, 5&lt;BR /&gt;};&lt;BR /&gt;double a[13] =&lt;BR /&gt;{ 1.0,-1.0, -3.0,&lt;BR /&gt;-2.0, 5.0,&lt;BR /&gt;4.0, 6.0, 4.0,&lt;BR /&gt;-4.0, 2.0, 7.0,&lt;BR /&gt;8.0, -5.0&lt;BR /&gt;};&lt;BR /&gt;MKL_INT mtype = 11; /* Real unsymmetric matrix */&lt;BR /&gt;// Descriptor of main sparse matrix properties&lt;BR /&gt;struct matrix_descr descrA;&lt;BR /&gt;// Structure with sparse matrix stored in CSR format&lt;BR /&gt;sparse_matrix_t csrA;&lt;BR /&gt;sparse_operation_t transA;&lt;BR /&gt;/* RHS and solution vectors. */&lt;BR /&gt;double b[5], x[5], bs[5], res, res0;&lt;BR /&gt;MKL_INT nrhs = 1; /* Number of right hand sides. */&lt;BR /&gt;/* Internal solver memory pointer pt, */&lt;BR /&gt;/* 32-bit: int pt[64]; 64-bit: long int pt[64] */&lt;BR /&gt;/* or void *pt[64] should be OK on both architectures */&lt;BR /&gt;void* pt[64];&lt;BR /&gt;/* Pardiso control parameters. */&lt;BR /&gt;MKL_INT iparm[64];&lt;BR /&gt;MKL_INT maxfct, mnum, phase, error, msglvl;&lt;BR /&gt;/* Auxiliary variables. */&lt;BR /&gt;MKL_INT i, j;&lt;BR /&gt;double ddum; /* Double dummy */&lt;BR /&gt;MKL_INT idum; /* Integer dummy. */&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;/* .. Setup Pardiso control parameters. */&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;for ( i = 0; i &amp;lt; 64; i++ )&lt;BR /&gt;{&lt;BR /&gt;iparm[i] = 0;&lt;BR /&gt;}&lt;BR /&gt;iparm[0] = 1; /* No solver default */&lt;BR /&gt;iparm[1] = 2; /* Fill-in reordering from METIS */&lt;BR /&gt;&lt;BR /&gt;iparm[2] = 1; //# procs&lt;BR /&gt;&lt;BR /&gt;iparm[3] = 0; /* No iterative-direct algorithm */&lt;BR /&gt;iparm[4] = 0; /* No user fill-in reducing permutation */&lt;BR /&gt;iparm[5] = 0; /* Write solution into x */&lt;BR /&gt;iparm[6] = 0; /* Not in use */&lt;BR /&gt;iparm[7] = 2; /* Max numbers of iterative refinement steps */&lt;BR /&gt;iparm[8] = 0; /* Not in use */&lt;BR /&gt;iparm[9] = 13; /* Perturb the pivot elements with 1E-13 */&lt;BR /&gt;iparm[10] = 1; /* Use nonsymmetric permutation and scaling MPS */&lt;BR /&gt;iparm[11] = 0; /* Conjugate transposed/transpose solve */&lt;BR /&gt;iparm[12] = 1; /* Maximum weighted matching algorithm is switched-on (default for non-symmetric) */&lt;BR /&gt;iparm[12] = 0;&lt;BR /&gt;iparm[13] = 0; /* Output: Number of perturbed pivots */&lt;BR /&gt;iparm[14] = 0; /* Not in use */&lt;BR /&gt;iparm[15] = 0; /* Not in use */&lt;BR /&gt;iparm[16] = 0; /* Not in use */&lt;BR /&gt;iparm[17] = -1; /* Output: Number of nonzeros in the factor LU */&lt;BR /&gt;iparm[18] = -1; /* Output: Mflops for LU factorization */&lt;BR /&gt;iparm[19] = 0; /* Output: Numbers of CG Iterations */&lt;/P&gt;&lt;P&gt;maxfct = 1; /* Maximum number of numerical factorizations. */&lt;BR /&gt;mnum = 1; /* Which factorization to use. */&lt;BR /&gt;msglvl = 1; /* Print statistical information */&lt;BR /&gt;error = 0; /* Initialize error flag */&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;/* .. Initialize the internal solver memory pointer. This is only */&lt;BR /&gt;/* necessary for the FIRST call of the PARDISO solver. */&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;for ( i = 0; i &amp;lt; 64; i++ )&lt;BR /&gt;{&lt;BR /&gt;pt[i] = 0;&lt;BR /&gt;}&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;/* .. Reordering and Symbolic Factorization. This step also allocates */&lt;BR /&gt;/* all memory that is necessary for the factorization. */&lt;BR /&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;phase = 11;&lt;BR /&gt;PARDISO(pt, &amp;amp;maxfct, &amp;amp;mnum, &amp;amp;mtype, &amp;amp;phase,&lt;BR /&gt;&amp;amp;n, a, ia, ja, &amp;amp;idum, &amp;amp;nrhs, iparm, &amp;amp;msglvl, &amp;amp;ddum, &amp;amp;ddum, &amp;amp;error);&lt;BR /&gt;if ( error != 0 )&lt;BR /&gt;{&lt;BR /&gt;printf("\nERROR during symbolic factorization: " IFORMAT, error);&lt;BR /&gt;exit(1);&lt;BR /&gt;}&lt;/P&gt;&lt;P&gt;etc.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;I tried a 1x1 matrix vector system but with the same result.&lt;/P&gt;&lt;P&gt;Someone any idea?&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Thanks!&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Mon, 10 Feb 2025 10:37:12 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-returns-error-code-1/m-p/1664610#M36926</guid>
      <dc:creator>PhilipS1</dc:creator>
      <dc:date>2025-02-10T10:37:12Z</dc:date>
    </item>
    <item>
      <title>Re: pardiso returns error code -1</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-returns-error-code-1/m-p/1664961#M36930</link>
      <description>&lt;P&gt;Ok, found the solution myself, maybe helping others:&lt;/P&gt;&lt;P&gt;In the installation of oneAPI in step 3 (integrate with IDE) integrate with Visual Studio 2022 and then in the project properties -&amp;gt; Configuration Properties you see "Intel(R) Libraries for oneAPI", where you can select "Use oneMKL", set this to eg parallel.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Then all works fine.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;best regards,&lt;/P&gt;&lt;P&gt;Philip&lt;/P&gt;</description>
      <pubDate>Tue, 11 Feb 2025 11:51:15 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-returns-error-code-1/m-p/1664961#M36930</guid>
      <dc:creator>PhilipS1</dc:creator>
      <dc:date>2025-02-11T11:51:15Z</dc:date>
    </item>
  </channel>
</rss>

