<?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 Solving real unsymmetric system in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Solving-real-unsymmetric-system/m-p/1734658#M37509</link>
    <description>&lt;DIV&gt;Dear Intel Community,&lt;/DIV&gt;&lt;DIV&gt;I am new to MKL library. I was trying to calculate the solution of a real-unsymmetric system. Unfortunately, I'm not able to obtain expected result. I have used the following parameter setting. Could someone please give a feedback.&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_size = 0;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_initialized = false;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;bool symmetric = FALSE;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_msglvl = 0; // No output&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_type = 11; // isSemidefinite ? -2 : 2;&amp;nbsp; //LDLT or LLT&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;memset(m_iparm, 0, sizeof(m_iparm));&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_factorizationIsOk = false;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[0] = 1;&amp;nbsp; &amp;nbsp;// No solver default&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[1] = 3;&amp;nbsp; &amp;nbsp;// use Metis for the ordering&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[2] = 1;&amp;nbsp; &amp;nbsp;// Numbers of processors, value of OMP_NUM_THREADS&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[3] = 0;&amp;nbsp; &amp;nbsp;// No iterative-direct algorithm&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[4] = 0;&amp;nbsp; &amp;nbsp;// No user fill-in reducing permutation&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[5] = 0;&amp;nbsp; &amp;nbsp;// Write solution into x&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[6] = 0;&amp;nbsp; &amp;nbsp;// Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[7] = 2;&amp;nbsp; &amp;nbsp;// Max numbers of iterative refinement steps&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[8] = 0;&amp;nbsp; &amp;nbsp;// Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[9] = 10;&amp;nbsp; // Perturb the pivot elements with 1E-13&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[11] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[12] = symmetric ? 0 : 1;&amp;nbsp; // Maximum weighted matching algorithm is switched-off (default for symmetric).&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[13] = 0;&amp;nbsp; // Output: Number of perturbed pivots&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[14] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[15] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[16] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[17] = -1; // Output: Number of nonzeros in the factor LU&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[18] = -1; // Output: Mflops for LU factorization&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[19] = 0;&amp;nbsp; // Output: Numbers of CG Iterations&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[20] = 0;&amp;nbsp; // 1x1 pivoting&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[26] = 0;&amp;nbsp; // No matrix checker&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[27] = 0; //double&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[34] = 1;&amp;nbsp; // C indexing&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[59] = 1;&amp;nbsp; // Automatic switch between In-Core and Out-of-Core modes&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Adding to above, I believe that the algorithm used in PARDISO for solving real-unsymmetric system is LU decomposition, which can solve both symmetric as well as unsymmetric matrices. So, do I need to switch to Cholesky setting or can I use LU method for symmetric case too?&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;</description>
    <pubDate>Sun, 25 Jan 2026 10:06:48 GMT</pubDate>
    <dc:creator>Aakash_Dwivedi</dc:creator>
    <dc:date>2026-01-25T10:06:48Z</dc:date>
    <item>
      <title>Solving real unsymmetric system</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Solving-real-unsymmetric-system/m-p/1734658#M37509</link>
      <description>&lt;DIV&gt;Dear Intel Community,&lt;/DIV&gt;&lt;DIV&gt;I am new to MKL library. I was trying to calculate the solution of a real-unsymmetric system. Unfortunately, I'm not able to obtain expected result. I have used the following parameter setting. Could someone please give a feedback.&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_size = 0;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_initialized = false;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;bool symmetric = FALSE;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_msglvl = 0; // No output&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_type = 11; // isSemidefinite ? -2 : 2;&amp;nbsp; //LDLT or LLT&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;memset(m_iparm, 0, sizeof(m_iparm));&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_factorizationIsOk = false;&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[0] = 1;&amp;nbsp; &amp;nbsp;// No solver default&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[1] = 3;&amp;nbsp; &amp;nbsp;// use Metis for the ordering&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[2] = 1;&amp;nbsp; &amp;nbsp;// Numbers of processors, value of OMP_NUM_THREADS&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[3] = 0;&amp;nbsp; &amp;nbsp;// No iterative-direct algorithm&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[4] = 0;&amp;nbsp; &amp;nbsp;// No user fill-in reducing permutation&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[5] = 0;&amp;nbsp; &amp;nbsp;// Write solution into x&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[6] = 0;&amp;nbsp; &amp;nbsp;// Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[7] = 2;&amp;nbsp; &amp;nbsp;// Max numbers of iterative refinement steps&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[8] = 0;&amp;nbsp; &amp;nbsp;// Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[9] = 10;&amp;nbsp; // Perturb the pivot elements with 1E-13&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[11] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[12] = symmetric ? 0 : 1;&amp;nbsp; // Maximum weighted matching algorithm is switched-off (default for symmetric).&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[13] = 0;&amp;nbsp; // Output: Number of perturbed pivots&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[14] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[15] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[16] = 0;&amp;nbsp; // Not in use&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[17] = -1; // Output: Number of nonzeros in the factor LU&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[18] = -1; // Output: Mflops for LU factorization&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[19] = 0;&amp;nbsp; // Output: Numbers of CG Iterations&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[20] = 0;&amp;nbsp; // 1x1 pivoting&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[26] = 0;&amp;nbsp; // No matrix checker&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[27] = 0; //double&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[34] = 1;&amp;nbsp; // C indexing&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;m_iparm[59] = 1;&amp;nbsp; // Automatic switch between In-Core and Out-of-Core modes&lt;/SPAN&gt;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Adding to above, I believe that the algorithm used in PARDISO for solving real-unsymmetric system is LU decomposition, which can solve both symmetric as well as unsymmetric matrices. So, do I need to switch to Cholesky setting or can I use LU method for symmetric case too?&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;</description>
      <pubDate>Sun, 25 Jan 2026 10:06:48 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Solving-real-unsymmetric-system/m-p/1734658#M37509</guid>
      <dc:creator>Aakash_Dwivedi</dc:creator>
      <dc:date>2026-01-25T10:06:48Z</dc:date>
    </item>
  </channel>
</rss>

