<?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: MKL Sparse Solver and maximum number of unknowns in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/MKL-Sparse-Solver-and-maximum-number-of-unknowns/m-p/869245#M8312</link>
    <description>I use MKL for finite element work as well. The amount of memory needed is dependent on the sparse structure of the matrix, not necessarily the number of unknowns.
&lt;BR /&gt;
&lt;BR /&gt;As an alternative to MKL, I would suggest also looking at TAUCS for an out-of-core sparse solver for positive definite symmetric matrices. I have used that on problems that use far more than 2G.
&lt;BR /&gt;</description>
    <pubDate>Tue, 01 May 2007 21:46:19 GMT</pubDate>
    <dc:creator>AndrewC</dc:creator>
    <dc:date>2007-05-01T21:46:19Z</dc:date>
    <item>
      <title>MKL Sparse Solver and maximum number of unknowns</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/MKL-Sparse-Solver-and-maximum-number-of-unknowns/m-p/869244#M8311</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;I have been using MKL for its sparse solver capabilities. My code is a finite element analysis solver. My code solves piezoelectric problems. Each element has 20 nodes and each node has 4 degrees of freedom. If am looking at a 10,000 element problem we are looking at (20*10000*4) 800K number of unknowns. &lt;/P&gt;
&lt;P&gt;I am running in Windows 32 bit application so I am limited to the 2 Gigs limit imposed by Microsoft. Based on this limit what is the maximum number of unknowns (degrees of freedom) I can solve for using the MKL sparse solver, anyone looked at this?&lt;/P&gt;
&lt;P&gt;Any help on this will be greatly appreciated.&lt;/P&gt;
&lt;P&gt;Marcias Martinez&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;</description>
      <pubDate>Fri, 13 Apr 2007 17:18:39 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/MKL-Sparse-Solver-and-maximum-number-of-unknowns/m-p/869244#M8311</guid>
      <dc:creator>marcias_martinez</dc:creator>
      <dc:date>2007-04-13T17:18:39Z</dc:date>
    </item>
    <item>
      <title>Re: MKL Sparse Solver and maximum number of unknowns</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/MKL-Sparse-Solver-and-maximum-number-of-unknowns/m-p/869245#M8312</link>
      <description>I use MKL for finite element work as well. The amount of memory needed is dependent on the sparse structure of the matrix, not necessarily the number of unknowns.
&lt;BR /&gt;
&lt;BR /&gt;As an alternative to MKL, I would suggest also looking at TAUCS for an out-of-core sparse solver for positive definite symmetric matrices. I have used that on problems that use far more than 2G.
&lt;BR /&gt;</description>
      <pubDate>Tue, 01 May 2007 21:46:19 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/MKL-Sparse-Solver-and-maximum-number-of-unknowns/m-p/869245#M8312</guid>
      <dc:creator>AndrewC</dc:creator>
      <dc:date>2007-05-01T21:46:19Z</dc:date>
    </item>
  </channel>
</rss>

