<?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 You may attach your matrix in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/The-difference-in-the-common-sparse-solver-function-result-and/m-p/1089118#M23130</link>
    <description>&lt;P&gt;You may attach your matrix and your code here, so we can understand the situation better.&amp;nbsp;&lt;/P&gt;

&lt;P&gt;When you go from PARDISO to the cluster sparse solver, the level of parallelism may have changed. You were using multiple threads before and are now using multiple MPI processes with, potentially, multiple threads in each process. Can you describe the configuration of your cluster? What kind of CPUs? How many nodes and MPI processes? How many threads do you use for each process, etc.?&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Mon, 30 Nov 2015 20:46:00 GMT</pubDate>
    <dc:creator>Zhang_Z_Intel</dc:creator>
    <dc:date>2015-11-30T20:46:00Z</dc:date>
    <item>
      <title>The difference in the common sparse solver function result and cluster sparse solver function result</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/The-difference-in-the-common-sparse-solver-function-result-and/m-p/1089117#M23129</link>
      <description>&lt;P&gt;Hello.&lt;/P&gt;

&lt;P&gt;I'm Using MKL Pardiso Sparse Solver (PARDISO).&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;

&lt;P&gt;Some time ago, I&amp;nbsp;Using Intel Parallel Studio 2013 Version (MKL 11.2).&lt;/P&gt;

&lt;P&gt;Recently, I'm Update&amp;nbsp;Intel Parallel Studio 2016 (MKL 11.3).&lt;/P&gt;

&lt;P&gt;This Version Support Cluster Sparse Solver. so I using this Function.&lt;/P&gt;

&lt;P&gt;But Solving result is difference. (about 0.02)&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;

&lt;P&gt;Originally does the other result come out?&lt;/P&gt;

&lt;P&gt;Or is there the condition getting the little more exact result?&lt;/P&gt;</description>
      <pubDate>Mon, 30 Nov 2015 10:08:22 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/The-difference-in-the-common-sparse-solver-function-result-and/m-p/1089117#M23129</guid>
      <dc:creator>Anonymous100</dc:creator>
      <dc:date>2015-11-30T10:08:22Z</dc:date>
    </item>
    <item>
      <title>You may attach your matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/The-difference-in-the-common-sparse-solver-function-result-and/m-p/1089118#M23130</link>
      <description>&lt;P&gt;You may attach your matrix and your code here, so we can understand the situation better.&amp;nbsp;&lt;/P&gt;

&lt;P&gt;When you go from PARDISO to the cluster sparse solver, the level of parallelism may have changed. You were using multiple threads before and are now using multiple MPI processes with, potentially, multiple threads in each process. Can you describe the configuration of your cluster? What kind of CPUs? How many nodes and MPI processes? How many threads do you use for each process, etc.?&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Mon, 30 Nov 2015 20:46:00 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/The-difference-in-the-common-sparse-solver-function-result-and/m-p/1089118#M23130</guid>
      <dc:creator>Zhang_Z_Intel</dc:creator>
      <dc:date>2015-11-30T20:46:00Z</dc:date>
    </item>
  </channel>
</rss>

