<?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 from explicit QR to compact form? in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785455#M1830</link>
    <description>Hello Alexander,&lt;BR /&gt;&lt;BR /&gt;Thank you, that's smart :) a good tip indeed but I meant implicitly not having to recompute the QR from scratch. In any case I understood the in and outs of the representation so I would be able to modify it myself directly with updates i.e.&lt;BR /&gt;&lt;BR /&gt;upper trapezoidal: R (including the diagonal)&lt;BR /&gt;lower: the householder/givens rotator column vectors v_i&lt;BR /&gt;tau: the householder coeffiencients t_i&lt;BR /&gt;&lt;BR /&gt;I can build H = I - t_i*(v_i*v_i') this last bit is an outer product that makes a matrix.&lt;BR /&gt;&lt;BR /&gt;I kind of started to understand how to manually update the QR addrows, addcols, delcols. My problem is translating whatever algorithm I can think of into something that can be most efficiently integrated with MKL.&lt;BR /&gt;There are some implementations I know:&lt;BR /&gt;&lt;A href="http://www.maths.manchester.ac.uk/~clucas/updating/" target="_blank"&gt;http://www.maths.manchester.ac.uk/~clucas/updating/&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;but have had trouble integrating it, and besides they are general and my case is simpler e.g. my addcols is always append column at the end.&lt;BR /&gt;&lt;BR /&gt;Best regards,&lt;BR /&gt;Giovanni</description>
    <pubDate>Fri, 30 Mar 2012 08:27:28 GMT</pubDate>
    <dc:creator>Azua_Garcia__Giovann</dc:creator>
    <dc:date>2012-03-30T08:27:28Z</dc:date>
    <item>
      <title>from explicit QR to compact form?</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785453#M1828</link>
      <description>&lt;P&gt;Hello,&lt;BR /&gt;&lt;BR /&gt;I use LAPACK_dgeqrf to compute QR factorization and this one returns a compact representation in which the Q is not formed explicitly (I believe is in the WY compact form), then I use the documented two methods to use such compact QR to solve systems of equations.&lt;BR /&gt;&lt;BR /&gt;I found an algorithm that updates the QR when blocks of rows are added to the corresponding matrix but this algorithm gives back a Q and R explicitly. Now I need to convert these explicitly formed Q and R into the compact form needed to interface with MKL or LAPACK.&lt;BR /&gt;&lt;BR /&gt;Are there helper MKL functions to create the compact representation given the explicit Q and R?&lt;BR /&gt;&lt;BR /&gt;TIA,&lt;BR /&gt;Best regards,&lt;BR /&gt;Giovanni&lt;/P&gt;</description>
      <pubDate>Fri, 23 Mar 2012 19:28:44 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785453#M1828</guid>
      <dc:creator>Azua_Garcia__Giovann</dc:creator>
      <dc:date>2012-03-23T19:28:44Z</dc:date>
    </item>
    <item>
      <title>from explicit QR to compact form?</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785454#M1829</link>
      <description>Hello Giovanni,&lt;BR /&gt;&lt;BR /&gt;You could obtain the WY representation of explicitly formed Q by running DGEQRF on the Q. It will return you R equal to identity matrix and the same Q butin the compact form.&lt;BR /&gt;&lt;BR /&gt;W.B.R.,&lt;BR /&gt;Alexander</description>
      <pubDate>Fri, 30 Mar 2012 04:09:42 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785454#M1829</guid>
      <dc:creator>Alexander_K_Intel3</dc:creator>
      <dc:date>2012-03-30T04:09:42Z</dc:date>
    </item>
    <item>
      <title>from explicit QR to compact form?</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785455#M1830</link>
      <description>Hello Alexander,&lt;BR /&gt;&lt;BR /&gt;Thank you, that's smart :) a good tip indeed but I meant implicitly not having to recompute the QR from scratch. In any case I understood the in and outs of the representation so I would be able to modify it myself directly with updates i.e.&lt;BR /&gt;&lt;BR /&gt;upper trapezoidal: R (including the diagonal)&lt;BR /&gt;lower: the householder/givens rotator column vectors v_i&lt;BR /&gt;tau: the householder coeffiencients t_i&lt;BR /&gt;&lt;BR /&gt;I can build H = I - t_i*(v_i*v_i') this last bit is an outer product that makes a matrix.&lt;BR /&gt;&lt;BR /&gt;I kind of started to understand how to manually update the QR addrows, addcols, delcols. My problem is translating whatever algorithm I can think of into something that can be most efficiently integrated with MKL.&lt;BR /&gt;There are some implementations I know:&lt;BR /&gt;&lt;A href="http://www.maths.manchester.ac.uk/~clucas/updating/" target="_blank"&gt;http://www.maths.manchester.ac.uk/~clucas/updating/&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;but have had trouble integrating it, and besides they are general and my case is simpler e.g. my addcols is always append column at the end.&lt;BR /&gt;&lt;BR /&gt;Best regards,&lt;BR /&gt;Giovanni</description>
      <pubDate>Fri, 30 Mar 2012 08:27:28 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/from-explicit-QR-to-compact-form/m-p/785455#M1830</guid>
      <dc:creator>Azua_Garcia__Giovann</dc:creator>
      <dc:date>2012-03-30T08:27:28Z</dc:date>
    </item>
  </channel>
</rss>

