https://software.intel.com/de-de/forums/topic/367666/feed
deah yes! many many thanks!
https://software.intel.com/de-de/comment/1725530#comment-1725530
<a id="comment-1725530"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>ah yes! many many thanks!</p>
</div></div></div>Wed, 20 Feb 2013 18:24:43 +0000mu k.comment 1725530 at https://software.intel.comYou have Y, the Fourier
https://software.intel.com/de-de/comment/1725062#comment-1725062
<a id="comment-1725062"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>You have Y, the Fourier transform of Yn.</p>
<p>You want to compute X which is (or rather seems to be) the convolution of Y and some function whose Fourier transform is k2. If this is the case, then our recommendation is the following:</p>
<p> - take inverse Fourier of Y to obtain Yn</p>
<p> - compute elementwise multiplication k2 and y (say result is tmp)</p>
<p> - finally compute FFT of tmp to obtain X</p>
<p>MKL can do the FFT, but the elementwise multiplication of k2 and Yn can be computed by a simple loop. Use the O3 compiler optimization to get the best results out of that loop.</p>
</div></div></div>Fri, 15 Feb 2013 22:10:58 +0000Noah Clemons (Intel)comment 1725062 at https://software.intel.comHi, just letting you know
https://software.intel.com/de-de/comment/1724936#comment-1724936
<a id="comment-1724936"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>Hi, just letting you know that I am still thinking about an elegant way to do this problem. It is turning out to be harder than I thought, and I thank you for coming up with this situation. Sorry it is taking awhile to figure out. From the first glance, I don't think we can support the sum with k^2, it is not and FFT, but I think it still may be possible to compute this in a different way still using MKL.</p>
</div></div></div>Thu, 14 Feb 2013 23:02:06 +0000Noah Clemons (Intel)comment 1724936 at https://software.intel.com>>>It is right that FFT(ik2Yn
https://software.intel.com/de-de/comment/1724495#comment-1724495
<a id="comment-1724495"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>>>>It is right that FFT(ik<sup>2</sup>Y<sub>n</sub>)=X?>>></p>
<p>I do not know if you will get X , but in tthis case you are doing Inverse FFT on already transformed function so you will get Y.</p>
</div></div></div>Tue, 12 Feb 2013 09:42:00 +0000iliyapolakcomment 1724495 at https://software.intel.commany thanks for your time, I
https://software.intel.com/de-de/comment/1724366#comment-1724366
<a id="comment-1724366"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>many thanks for your time, I'm looking forward - this is really a problem for me...</p>
</p>
</div></div></div>Mon, 11 Feb 2013 17:59:18 +0000mu k.comment 1724366 at https://software.intel.comHi, please give me a day to
https://software.intel.com/de-de/comment/1724348#comment-1724348
<a id="comment-1724348"></a>
<div class="field field-name-comment-body field-type-text-long field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p>Hi, please give me a day to think about how to do this using MKL and/or a combination with VML and I will get back to you right away.</p>
</div></div></div>Mon, 11 Feb 2013 16:55:57 +0000Noah Clemons (Intel)comment 1724348 at https://software.intel.com