<?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 Fastest method to sum matrix in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806094#M3427</link>
    <description>That seems like a good idea, do you think it will be worth my time to work with 1D arrays (which will make the code very unreadable) or just do a reshape every time (this product will occur a lot of times using matrices which are typically (1024,1024) big, so basically I'm asking if the reshape command is very time consuming)&lt;BR /&gt;&lt;BR /&gt;Elad</description>
    <pubDate>Tue, 25 Oct 2011 18:07:41 GMT</pubDate>
    <dc:creator>Tan__Elad</dc:creator>
    <dc:date>2011-10-25T18:07:41Z</dc:date>
    <item>
      <title>Fastest method to sum matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806092#M3425</link>
      <description>Hello,&lt;BR /&gt;&lt;BR /&gt;I want to take the sum of a product of two symmetric matrices, meaning that if A and B are symmetric matrices than I want to compute &lt;BR /&gt;c=sum(A*B)&lt;BR /&gt;where c is a scalar and the multiplication is done element wise. Is there some way to do this by using an MKL routine or is the fastest method using the default compiler commands?&lt;BR /&gt;&lt;BR /&gt;Elad</description>
      <pubDate>Tue, 25 Oct 2011 17:38:19 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806092#M3425</guid>
      <dc:creator>Tan__Elad</dc:creator>
      <dc:date>2011-10-25T17:38:19Z</dc:date>
    </item>
    <item>
      <title>Fastest method to sum matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806093#M3426</link>
      <description>It seems to me that you really do not want a matrix product, but the scalar product of two &lt;B&gt;vectors&lt;/B&gt; (i.e., 1-D arrays) that happen to be mis-arranged as square matrices. Look up the &lt;B&gt;reshape&lt;/B&gt; function in your Fortran manual, so that you can cast the operation that is desired by you into an equivalent scalar product evaluation.</description>
      <pubDate>Tue, 25 Oct 2011 18:01:59 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806093#M3426</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2011-10-25T18:01:59Z</dc:date>
    </item>
    <item>
      <title>Fastest method to sum matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806094#M3427</link>
      <description>That seems like a good idea, do you think it will be worth my time to work with 1D arrays (which will make the code very unreadable) or just do a reshape every time (this product will occur a lot of times using matrices which are typically (1024,1024) big, so basically I'm asking if the reshape command is very time consuming)&lt;BR /&gt;&lt;BR /&gt;Elad</description>
      <pubDate>Tue, 25 Oct 2011 18:07:41 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806094#M3427</guid>
      <dc:creator>Tan__Elad</dc:creator>
      <dc:date>2011-10-25T18:07:41Z</dc:date>
    </item>
    <item>
      <title>Fastest method to sum matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806095#M3428</link>
      <description>Is there some routine other than reshape that converts a symmetrical matrix into a packed scheme?&lt;BR /&gt;</description>
      <pubDate>Tue, 25 Oct 2011 19:18:12 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806095#M3428</guid>
      <dc:creator>Tan__Elad</dc:creator>
      <dc:date>2011-10-25T19:18:12Z</dc:date>
    </item>
    <item>
      <title>Fastest method to sum matrix</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806096#M3429</link>
      <description>Fortran has always allowed argument association between multidimensional arrays and one-dimensional arrays, as in the example below. Note that this will not work if you use subroutine arguments of assumed shape.&lt;BR /&gt;&lt;BR /&gt;&lt;PRE&gt;[fortran]program treshape
integer A(3,3)
data  A/11,12,13,21,22,23,31,32,33/
call sub(A,3*3)
end program treshape

subroutine sub(A,n)
integer A(n)
write(*,10)(i,A(i),i=1,n)
10 format(I4,2x,I4)
return
end subroutine sub
[/fortran]&lt;/PRE&gt; Converting a dense matrix to packed or banded matrices is straightforward. Read the section on matrix storage schemes in the MKL manual.</description>
      <pubDate>Tue, 25 Oct 2011 23:01:29 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Fastest-method-to-sum-matrix/m-p/806096#M3429</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2011-10-25T23:01:29Z</dc:date>
    </item>
  </channel>
</rss>

