<?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 Does this mean that it is in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114056#M24547</link>
    <description>&lt;P&gt;Does this mean that it is impossible to get L and D factors "exported" as a matrix?&lt;/P&gt;</description>
    <pubDate>Wed, 02 Nov 2016 19:16:09 GMT</pubDate>
    <dc:creator>Ivan_K_6</dc:creator>
    <dc:date>2016-11-02T19:16:09Z</dc:date>
    <item>
      <title>modifying the pardiso solver's sparse factorization</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114054#M24545</link>
      <description>&lt;P&gt;I am attempting to implement &lt;A href="http://faculty.cse.tamu.edu/davis/publications_files/Modifying_a_Sparse_Cholesky_Factorization.pdf"&gt;this algorithm&lt;/A&gt;&amp;nbsp;for efficiently computing the solution to a sparse linear system of equations when small changes are made to the input matrix A by updating only the matrix L in the LDL&lt;SUP&gt;T&lt;/SUP&gt;&amp;nbsp;factorization of A. &amp;nbsp;However, from what I have seen there is no documentation about accessing L and D in the pardiso solver. &amp;nbsp;Ideally, my code would look roughly like this:&lt;/P&gt;

&lt;P&gt;1. run solver on matrix A with phase 13&lt;/P&gt;

&lt;P&gt;2. use solution to compute modification to matrix A&lt;/P&gt;

&lt;P&gt;3. use the linked algorithm to directly modify L and D, still in pardiso's memory&lt;/P&gt;

&lt;P&gt;4. run solve on matrix A with phase 33, which should use the modified L and D to instead solve the system for the modified matrix A&lt;/P&gt;

&lt;P&gt;5. repeat steps 2 through 4&amp;nbsp;&lt;/P&gt;

&lt;P&gt;How would I go about doing this? &amp;nbsp;Is it even possible with pardiso?&lt;/P&gt;</description>
      <pubDate>Tue, 02 Feb 2016 17:41:28 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114054#M24545</guid>
      <dc:creator>Jaron_K_</dc:creator>
      <dc:date>2016-02-02T17:41:28Z</dc:date>
    </item>
    <item>
      <title>You may get the diagonal</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114055#M24546</link>
      <description>&lt;P&gt;You may get the diagonal elements of initial or factorized matrix by using pardiso_getdiag() routine and with regard to L:&amp;nbsp;you couldn't obtained and the update L part of factorized matrix.&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Tue, 02 Feb 2016 19:37:10 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114055#M24546</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2016-02-02T19:37:10Z</dc:date>
    </item>
    <item>
      <title>Does this mean that it is</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114056#M24547</link>
      <description>&lt;P&gt;Does this mean that it is impossible to get L and D factors "exported" as a matrix?&lt;/P&gt;</description>
      <pubDate>Wed, 02 Nov 2016 19:16:09 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114056#M24547</guid>
      <dc:creator>Ivan_K_6</dc:creator>
      <dc:date>2016-11-02T19:16:09Z</dc:date>
    </item>
    <item>
      <title>yes. that's not possible </title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114057#M24548</link>
      <description>&lt;P&gt;yes. that's not possible&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Thu, 03 Nov 2016 03:33:52 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114057#M24548</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2016-11-03T03:33:52Z</dc:date>
    </item>
    <item>
      <title>Hi,</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114058#M24549</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;

&lt;P&gt;Probably you can try &lt;A href="https://software.intel.com/en-us/articles/how-can-your-application-benefit-from-schur-complement-feature-of-intel-pardiso-nonlinear"&gt;this approach&lt;/A&gt; if you need to solve set of system with small changes in matrices.&lt;/P&gt;

&lt;P&gt;Thanks,&lt;/P&gt;

&lt;P&gt;Alex&lt;/P&gt;</description>
      <pubDate>Thu, 03 Nov 2016 03:50:44 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/modifying-the-pardiso-solver-s-sparse-factorization/m-p/1114058#M24549</guid>
      <dc:creator>Alexander_K_Intel2</dc:creator>
      <dc:date>2016-11-03T03:50:44Z</dc:date>
    </item>
  </channel>
</rss>

