<?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 The possible algorithm in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Can-Intel-s-Poisson-solver-routines-be-applied-to-the-following/m-p/1145605#M26670</link>
    <description>&lt;P&gt;The possible algorithm choices depend on whether&amp;nbsp;ε is (i) a constant, (ii) position dependent, or (iii) a known function of u. In the first two cases, the finite-difference equations are still linear, and can be solved using Pardiso as in the case when ε = 1. In the third case, you may use Kirchoff's transformation, φ = \int ε du, which leads to ∇.∇φ = f; you solve for φ, and recover u from φ at the end.&lt;/P&gt;</description>
    <pubDate>Mon, 22 Oct 2018 00:20:52 GMT</pubDate>
    <dc:creator>mecej4</dc:creator>
    <dc:date>2018-10-22T00:20:52Z</dc:date>
    <item>
      <title>Can Intel's Poisson solver routines be applied to the following general Poisson equation?</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Can-Intel-s-Poisson-solver-routines-be-applied-to-the-following/m-p/1145604#M26669</link>
      <description>&lt;P&gt;&lt;SPAN class="ILfuVd"&gt;Hi,&lt;BR /&gt;
	&lt;BR /&gt;
	I see in the &lt;A href="https://software.intel.com/en-us/mkl-developer-reference-c-fast-poisson-solver-routines"&gt;documentation&lt;/A&gt; that Intels' Poisson solver routines can be used to solve equations of the form&lt;/SPAN&gt;&lt;BR /&gt;
	&lt;BR /&gt;
	&lt;SPAN class="ILfuVd"&gt;∇.∇u = f&lt;BR /&gt;
	&lt;BR /&gt;
	Can they also (perhaps via some additional steps) be applied to an equation of the form&lt;BR /&gt;
	&lt;BR /&gt;
	∇.ε∇u = f&lt;/SPAN&gt;&lt;BR /&gt;
	&lt;BR /&gt;
	Thanks&lt;/P&gt;</description>
      <pubDate>Fri, 19 Oct 2018 12:34:38 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Can-Intel-s-Poisson-solver-routines-be-applied-to-the-following/m-p/1145604#M26669</guid>
      <dc:creator>greiner08</dc:creator>
      <dc:date>2018-10-19T12:34:38Z</dc:date>
    </item>
    <item>
      <title>The possible algorithm</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Can-Intel-s-Poisson-solver-routines-be-applied-to-the-following/m-p/1145605#M26670</link>
      <description>&lt;P&gt;The possible algorithm choices depend on whether&amp;nbsp;ε is (i) a constant, (ii) position dependent, or (iii) a known function of u. In the first two cases, the finite-difference equations are still linear, and can be solved using Pardiso as in the case when ε = 1. In the third case, you may use Kirchoff's transformation, φ = \int ε du, which leads to ∇.∇φ = f; you solve for φ, and recover u from φ at the end.&lt;/P&gt;</description>
      <pubDate>Mon, 22 Oct 2018 00:20:52 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Can-Intel-s-Poisson-solver-routines-be-applied-to-the-following/m-p/1145605#M26670</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2018-10-22T00:20:52Z</dc:date>
    </item>
  </channel>
</rss>

