<?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 QR factorisation from LAPACK in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/QR-factorisation-from-LAPACK/m-p/1011586#M19245</link>
    <description>&lt;P&gt;Hi,&lt;/P&gt;

&lt;P&gt;I would like to do a QR factorization using LAPACK. From the documentation available here&amp;nbsp;https://software.intel.com/en-us/node/521003#E832D468-0891-40EC-9468-6868C8EC9AD0 , I've decided to use geqrf &amp;nbsp;for the factorization.&lt;/P&gt;

&lt;P&gt;As I need to solve a Least square problem, I need to solve R.x = (Q1)^T b as explained in the documentation. You can apply matrix Q with the function ormqr. But, which routine should I use to solve R.x = y ?&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Thu, 03 Sep 2015 14:08:53 GMT</pubDate>
    <dc:creator>velvia</dc:creator>
    <dc:date>2015-09-03T14:08:53Z</dc:date>
    <item>
      <title>QR factorisation from LAPACK</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/QR-factorisation-from-LAPACK/m-p/1011586#M19245</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;

&lt;P&gt;I would like to do a QR factorization using LAPACK. From the documentation available here&amp;nbsp;https://software.intel.com/en-us/node/521003#E832D468-0891-40EC-9468-6868C8EC9AD0 , I've decided to use geqrf &amp;nbsp;for the factorization.&lt;/P&gt;

&lt;P&gt;As I need to solve a Least square problem, I need to solve R.x = (Q1)^T b as explained in the documentation. You can apply matrix Q with the function ormqr. But, which routine should I use to solve R.x = y ?&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Thu, 03 Sep 2015 14:08:53 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/QR-factorisation-from-LAPACK/m-p/1011586#M19245</guid>
      <dc:creator>velvia</dc:creator>
      <dc:date>2015-09-03T14:08:53Z</dc:date>
    </item>
    <item>
      <title>Velvia, can you explain what</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/QR-factorisation-from-LAPACK/m-p/1011587#M19246</link>
      <description>&lt;P&gt;Velvia, can you explain what you are attempting to do? If all you want is the least-squares solution to overdetermined equations with a full-rank matrix, you can use the "driver" routine ?GELS().&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Thu, 03 Sep 2015 21:46:41 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/QR-factorisation-from-LAPACK/m-p/1011587#M19246</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2015-09-03T21:46:41Z</dc:date>
    </item>
  </channel>
</rss>

