<?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: Re:Compute LU triangles directly for sparse (compressed row storage) vectors in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1391851#M33269</link>
    <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thank you for your reply!&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I would be looking at using pardiso with the three array variation of CSR format:&lt;/P&gt;
&lt;P&gt;&lt;A href="https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/appendix-a-linear-solvers-basics/sparse-matrix-storage-formats/sparse-blas-csr-matrix-storage-format.html" target="_blank"&gt;https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/appendix-a-linear-solvers-basics/sparse-matrix-storage-formats/sparse-blas-csr-matrix-storage-format.html&lt;/A&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Best,&lt;/P&gt;
&lt;P&gt;Evan&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Sun, 12 Jun 2022 09:19:27 GMT</pubDate>
    <dc:creator>EJRicketts</dc:creator>
    <dc:date>2022-06-12T09:19:27Z</dc:date>
    <item>
      <title>Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1390639#M33243</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I have a sparse/CRS vector which I would like to compute the LU decomposition of for the lower triangle. Is there a way to output this directly?&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thanks&lt;/P&gt;</description>
      <pubDate>Tue, 07 Jun 2022 15:47:18 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1390639#M33243</guid>
      <dc:creator>EJRicketts</dc:creator>
      <dc:date>2022-06-07T15:47:18Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1390938#M33250</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Thank you for posting on Intel Communities.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Could you please be more specific regarding the format in which you would like the operation to be performed, so that we could assist you in appropriate solvers to be used.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;In addition, Please refer to below link for the routines which would be useful to choose based on your desired operation to be performed and let us know if the use case matches your requirement.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/sparse-solver-routines/onemkl-pardiso-parallel-direct-sparse-solver-iface.html#onemkl-pardiso-parallel-direct-sparse-solver-iface" target="_blank"&gt;https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/sparse-solver-routines/onemkl-pardiso-parallel-direct-sparse-solver-iface.html#onemkl-pardiso-parallel-direct-sparse-solver-iface&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Wed, 08 Jun 2022 12:24:58 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1390938#M33250</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-06-08T12:24:58Z</dc:date>
    </item>
    <item>
      <title>Re: Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1391851#M33269</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thank you for your reply!&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I would be looking at using pardiso with the three array variation of CSR format:&lt;/P&gt;
&lt;P&gt;&lt;A href="https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/appendix-a-linear-solvers-basics/sparse-matrix-storage-formats/sparse-blas-csr-matrix-storage-format.html" target="_blank"&gt;https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/appendix-a-linear-solvers-basics/sparse-matrix-storage-formats/sparse-blas-csr-matrix-storage-format.html&lt;/A&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Best,&lt;/P&gt;
&lt;P&gt;Evan&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Sun, 12 Jun 2022 09:19:27 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1391851#M33269</guid>
      <dc:creator>EJRicketts</dc:creator>
      <dc:date>2022-06-12T09:19:27Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1393093#M33290</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Could you please let us know if you need L and U factors directly from Pardiso?&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 16 Jun 2022 17:34:01 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1393093#M33290</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-06-16T17:34:01Z</dc:date>
    </item>
    <item>
      <title>Re: Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1393094#M33291</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Yes, I would like the lower triangle of a sparse matrix.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thanks,&lt;/P&gt;
&lt;P&gt;Evan&lt;/P&gt;</description>
      <pubDate>Thu, 16 Jun 2022 17:37:06 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1393094#M33291</guid>
      <dc:creator>EJRicketts</dc:creator>
      <dc:date>2022-06-16T17:37:06Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1394784#M33318</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;As of now, there are no functions available for PARDISO which can return LU factors.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;We would like to request you to raise a Feature Request if you have it as a requirement.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 23 Jun 2022 11:21:03 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1394784#M33318</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-06-23T11:21:03Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1396525#M33334</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;A gentle reminder:&lt;/P&gt;&lt;P&gt;Has the information provided helped? Kindly let us know so that we could close this thread at our end.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Wed, 29 Jun 2022 18:33:43 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1396525#M33334</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-06-29T18:33:43Z</dc:date>
    </item>
    <item>
      <title>Re: Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1396779#M33341</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Just a last question. Is there a routine in the MKL which could perform a Cholesky decomposition of a matrix in CRS format? I know that ?potrf exists, but I think that this is for full arrays only.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Thanks,&lt;/P&gt;
&lt;P&gt;Evan&lt;/P&gt;</description>
      <pubDate>Thu, 30 Jun 2022 13:38:16 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1396779#M33341</guid>
      <dc:creator>EJRicketts</dc:creator>
      <dc:date>2022-06-30T13:38:16Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1398678#M33370</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;p?potrf computes the Cholesky factorization of a symmetric (Hermitian) positive-definite distributed matrix.&lt;/P&gt;&lt;P&gt;It computes the Cholesky factorization of a real symmetric or complex Hermitian positive-definite distributed n-by-n matrix A(ia:ia+n-1, ja:ja+n-1).&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Please find the below link for more information regarding the computational routine.&amp;nbsp;Kindly get back to us with more specific details in case of any help is needed.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/scalapack-routines/scalapack-computational-routines/matrix-factorization-scalapack-computation/p-potrf.html" target="_blank"&gt;https://www.intel.com/content/www/us/en/develop/documentation/onemkl-developer-reference-c/top/scalapack-routines/scalapack-computational-routines/matrix-factorization-scalapack-computation/p-potrf.html&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 07 Jul 2022 16:00:09 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1398678#M33370</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-07-07T16:00:09Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1400432#M33399</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;A gentle reminder:&lt;/P&gt;&lt;P&gt;Has the information provided helped? Kindly let us know so that we could close this thread at our end.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 14 Jul 2022 19:16:28 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1400432#M33399</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-07-14T19:16:28Z</dc:date>
    </item>
    <item>
      <title>Re:Compute LU triangles directly for sparse (compressed row storage) vectors</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1403732#M33436</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;We assume that your issue is resolved. If you need any additional information, please post a new question as this thread will no longer be monitored by Intel.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Best Regards,&lt;/P&gt;&lt;P&gt;Shanmukh.SS&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Wed, 27 Jul 2022 05:30:19 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Compute-LU-triangles-directly-for-sparse-compressed-row-storage/m-p/1403732#M33436</guid>
      <dc:creator>ShanmukhS_Intel</dc:creator>
      <dc:date>2022-07-27T05:30:19Z</dc:date>
    </item>
  </channel>
</rss>

