<?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 factorisation sensitivity to indefinite matrices in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1260869#M30973</link>
    <description>&lt;P&gt;The issue is closing and we will no longer respond to this thread.&amp;nbsp;If you require additional assistance from Intel, please start a new thread.&amp;nbsp;Any further interaction in this thread will be considered community only.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;BR /&gt;</description>
    <pubDate>Wed, 03 Mar 2021 02:57:51 GMT</pubDate>
    <dc:creator>Gennady_F_Intel</dc:creator>
    <dc:date>2021-03-03T02:57:51Z</dc:date>
    <item>
      <title>pardiso factorisation sensitivity to indefinite matrices</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1244195#M30614</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;I am wondering what pardiso's factorization sensitivity to linear dependencies in a symmetric matrix is.&lt;/P&gt;
&lt;P&gt;For a matrix where I know the two positions of the linear dependencies I found that&lt;/P&gt;
&lt;UL&gt;
&lt;LI&gt;when I leave the matrix dense mkl-lapack-potrf reports the correct diagonals where the element of the factor becomes zero.&lt;/LI&gt;
&lt;LI&gt;Turning the matrix into sparse format, pardiso reports only one diagonal element (iparm(30)), sometimes none, i.e. telling me that the matrix is of full rank.&lt;/LI&gt;
&lt;/UL&gt;
&lt;P&gt;I tried to find a knob which I could turn to make pardiso more sensitive to this problem such that pardiso produces the same results as potrf but couldn't find anything!&lt;/P&gt;
&lt;P&gt;Did I miss something??&lt;/P&gt;
&lt;P&gt;Thanks&lt;/P&gt;</description>
      <pubDate>Thu, 07 Jan 2021 12:22:25 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1244195#M30614</guid>
      <dc:creator>may_ka</dc:creator>
      <dc:date>2021-01-07T12:22:25Z</dc:date>
    </item>
    <item>
      <title>Re: pardiso factorisation sensitivity to indefinite matrices</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1245027#M30641</link>
      <description>&lt;P&gt;Hello&amp;nbsp;&lt;a href="https://community.intel.com/t5/user/viewprofilepage/user-id/77816"&gt;@may_ka&lt;/a&gt;,&lt;/P&gt;
&lt;P&gt;I believe the main reason for the different behavior of PARDISO vs LAPACK's potrf is the pivoting strategy. PARDISO uses a so called complete supernodal pivoting strategy. Essentially, the pivoting is done within each supernode&amp;nbsp; (which you can think of as a collection of columns) separately. While in LAPACK, I think, full pivoting strategy might be used.&lt;/P&gt;
&lt;P&gt;I suggest you try to change iparm(10) = iparm[9] which defines the tolerance for detecting zero pivots in PARDISO. The value to set there should depend on the order of the elements of the matrix. &lt;BR /&gt;Also, you can try to change the pivoting strategy via iparm(21) and set it to the diagonal 1x1 pivoting, in particular.&lt;/P&gt;
&lt;P&gt;If you have a small- or moderate-sized matrix which exhibits the described behavior [incorrect number of pivots is returned by PARDISO], you can share a reproducer with us. Then we would be able to find more details&amp;nbsp; about why the observed number of pivots is returned and if it is a bug, fix it.&lt;/P&gt;
&lt;P&gt;Best,&lt;BR /&gt;Kirill&lt;/P&gt;</description>
      <pubDate>Mon, 11 Jan 2021 04:11:25 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1245027#M30641</guid>
      <dc:creator>Kirill_V_Intel</dc:creator>
      <dc:date>2021-01-11T04:11:25Z</dc:date>
    </item>
    <item>
      <title>Re:pardiso factorisation sensitivity to indefinite matrices</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1260869#M30973</link>
      <description>&lt;P&gt;The issue is closing and we will no longer respond to this thread.&amp;nbsp;If you require additional assistance from Intel, please start a new thread.&amp;nbsp;Any further interaction in this thread will be considered community only.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Wed, 03 Mar 2021 02:57:51 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/pardiso-factorisation-sensitivity-to-indefinite-matrices/m-p/1260869#M30973</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2021-03-03T02:57:51Z</dc:date>
    </item>
  </channel>
</rss>

