<?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 This would be very useful for in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121577#M25000</link>
    <description>&lt;P&gt;This would be very useful for computing matrix functions of upper triangular matrices, e.g. when working with the Schur normal form.&lt;/P&gt;</description>
    <pubDate>Thu, 21 Apr 2016 17:25:19 GMT</pubDate>
    <dc:creator>Alexander_O_</dc:creator>
    <dc:date>2016-04-21T17:25:19Z</dc:date>
    <item>
      <title>Proposed GEMM Extension: Triangle Triangle Matrix Multiply</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121573#M24996</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;

&lt;P&gt;After speaking to one of the MKL developers recently I was wondering whether it might be beneficial to add some new functionality to MKL in order to compute triangular-triangular matrix products. As triangular matrices form a subgroup, the result will always remain triangular and can therefore be computed highly efficiently by performing only the minimal number of flops required.&lt;/P&gt;

&lt;P&gt;In particular, I work with matrix functions where we often require powers of the Schur factor of a matrix, which is triangular. This would be beneficial for anyone wishing to compute a polynomial or rational function of a matrix, for instance. In particular this would be used extensively to compute the logarithm, powers, and trigonometric functions of a matrix (see &lt;A href="http://eprints.ma.man.ac.uk/2431/01/covered/MIMS_ep2016_3.pdf" target="_blank"&gt;http://eprints.ma.man.ac.uk/2431/01/covered/MIMS_ep2016_3.pdf&lt;/A&gt; for a list of software that could potentially benefit from such a specialized routine). These algorithms are used in various applications including the solution of PDEs and in network analysis etc.&lt;/P&gt;

&lt;P&gt;This new routine could perhaps have a similar calling sequence to &amp;lt;?&amp;gt;GEMMT (https://software.intel.com/en-us/node/590135) since this is targeted at solving a similar problem.&lt;/P&gt;

&lt;P&gt;I am sure there are plenty of other applications that I currently don't know about that would highly benefit from this functionality. If you know of any, please leave a comment so that the developers of MKL receive some feedback and can consider implementing this extension.&lt;/P&gt;</description>
      <pubDate>Wed, 23 Mar 2016 11:56:34 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121573#M24996</guid>
      <dc:creator>p_kandolf</dc:creator>
      <dc:date>2016-03-23T11:56:34Z</dc:date>
    </item>
    <item>
      <title>I would also be very</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121574#M24997</link>
      <description>&lt;P&gt;I would also be very interested to see this functionality implemented.&lt;/P&gt;</description>
      <pubDate>Wed, 23 Mar 2016 12:04:59 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121574#M24997</guid>
      <dc:creator>sdrelton</dc:creator>
      <dc:date>2016-03-23T12:04:59Z</dc:date>
    </item>
    <item>
      <title>At mosek.com we implemented</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121575#M24998</link>
      <description>&lt;P&gt;At mosek.com we implemented out own version so we are interested too. We need it in our optimizer for semidefinite problems.&lt;/P&gt;</description>
      <pubDate>Wed, 23 Mar 2016 12:21:36 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121575#M24998</guid>
      <dc:creator>erling_andersen</dc:creator>
      <dc:date>2016-03-23T12:21:36Z</dc:date>
    </item>
    <item>
      <title>Thank you for all your</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121576#M24999</link>
      <description>&lt;P&gt;Thank you for all your interests in this request. I am adding this to our engineering tracker.&lt;/P&gt;

&lt;P&gt;--Vipin&lt;/P&gt;</description>
      <pubDate>Thu, 24 Mar 2016 05:17:58 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121576#M24999</guid>
      <dc:creator>VipinKumar_E_Intel</dc:creator>
      <dc:date>2016-03-24T05:17:58Z</dc:date>
    </item>
    <item>
      <title>This would be very useful for</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121577#M25000</link>
      <description>&lt;P&gt;This would be very useful for computing matrix functions of upper triangular matrices, e.g. when working with the Schur normal form.&lt;/P&gt;</description>
      <pubDate>Thu, 21 Apr 2016 17:25:19 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Proposed-GEMM-Extension-Triangle-Triangle-Matrix-Multiply/m-p/1121577#M25000</guid>
      <dc:creator>Alexander_O_</dc:creator>
      <dc:date>2016-04-21T17:25:19Z</dc:date>
    </item>
  </channel>
</rss>

