<?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 Pardiso low-rank update question in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Pardiso-low-rank-update-question/m-p/1183256#M29434</link>
    <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;I recently realized this functionality is available with pardiso - great!&lt;/P&gt;&lt;P&gt;I am testing it now and I have some questions. I have read the instructions in&amp;nbsp;https://software.intel.com/en-us/mkl-developer-reference-c-intel-mkl-pardiso-parallel-direct-sparse-solver-interface#LOW_RANK.&lt;/P&gt;&lt;P&gt;In particular, I am using matching as I am solving a highly indefinite symmetric system: iparm[12]=1. With iparm[12]=1 the instructions for iparm say A must be filled with relevant values during phase 11. This makes me wonder whether iparm[12]=1 is compatible with the low-rank update functionality (i.e. it suggests phase 11 must be run whenever A is updated as matching is enabled).&amp;nbsp;&lt;/P&gt;&lt;P&gt;I also note that the improved two-level factorization algorithm must be used with the low rank update (iparm[23]=10). But it is unclear to me whether matching works together with (improved) two-level&amp;nbsp;factorization.&lt;/P&gt;&lt;P&gt;Could you please clarify?&lt;BR /&gt;&lt;BR /&gt;Best,&lt;/P&gt;&lt;P&gt;Jens&lt;/P&gt;</description>
    <pubDate>Mon, 08 Apr 2019 19:30:50 GMT</pubDate>
    <dc:creator>Jens_E_</dc:creator>
    <dc:date>2019-04-08T19:30:50Z</dc:date>
    <item>
      <title>Pardiso low-rank update question</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Pardiso-low-rank-update-question/m-p/1183256#M29434</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;I recently realized this functionality is available with pardiso - great!&lt;/P&gt;&lt;P&gt;I am testing it now and I have some questions. I have read the instructions in&amp;nbsp;https://software.intel.com/en-us/mkl-developer-reference-c-intel-mkl-pardiso-parallel-direct-sparse-solver-interface#LOW_RANK.&lt;/P&gt;&lt;P&gt;In particular, I am using matching as I am solving a highly indefinite symmetric system: iparm[12]=1. With iparm[12]=1 the instructions for iparm say A must be filled with relevant values during phase 11. This makes me wonder whether iparm[12]=1 is compatible with the low-rank update functionality (i.e. it suggests phase 11 must be run whenever A is updated as matching is enabled).&amp;nbsp;&lt;/P&gt;&lt;P&gt;I also note that the improved two-level factorization algorithm must be used with the low rank update (iparm[23]=10). But it is unclear to me whether matching works together with (improved) two-level&amp;nbsp;factorization.&lt;/P&gt;&lt;P&gt;Could you please clarify?&lt;BR /&gt;&lt;BR /&gt;Best,&lt;/P&gt;&lt;P&gt;Jens&lt;/P&gt;</description>
      <pubDate>Mon, 08 Apr 2019 19:30:50 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Pardiso-low-rank-update-question/m-p/1183256#M29434</guid>
      <dc:creator>Jens_E_</dc:creator>
      <dc:date>2019-04-08T19:30:50Z</dc:date>
    </item>
  </channel>
</rss>

