I realize the list is large and I don't want to clutter inboxes, but
anyone who may be lightly considering GPU implementations should
understand that this technology, while useful for some applications, is
probably not economical for crystallography refinements. I do not have
personal programming
On Tue, Jan 24, 2012 at 1:38 AM, Adam Ralph wrote:
> CUDA is a set of extensions for C which will allow you to access hardware
> accelerators (certain NVidia cards in this case). CUDA has been around for
> a
> while and there are CUDA libraries for FFT and BLAS.
> I have not used cuFFT mysel
Those people considering running faster code should consider using GPGPUs.
Advantages of GPUs are that they have many more cores than CPU. The
disadvantages are that the communication between the CPU and GPU is slow and
memory management is tricker. Thus there is no guarantee that code will ru
After quick look at the manuscript: It is applicable to sparse signals (i.e.
number of non-zero elements is not whole space). It would be applicable to
inverse FFT after density modification and gain would not be that much.
k-sparse approximation would loose signal (strictly speaking it does not
George Sheldrick a écrit :
For all those interested in the technical details about this new
Fourier stuff, I saw that the whole paper is available from the web
site, not only the simplified account (look at right of this awfully
wrong 3-term Fourier synthesis illutration that I would never
From the rather non-technical inofrmation available so far, it seems to
me that it is like leaving out all but the strongest reflections (or
perhaps the strongest normalized structure factors). This is unlikely to
improve the quality of structure refinement, the importance of using as
much data
The problem is however, that the coffee break is lost in the noise of this FFT.
Jürgen
On Jan 20, 2012, at 12:57 PM, Ethan Merritt wrote:
On Friday, 20 January 2012, Jim Fairman wrote:
New Fourier transform algorithm supposedly improves the speed of Fourier
transforms get up to "a tenfold increa
On Friday, 20 January 2012, Jim Fairman wrote:
> New Fourier transform algorithm supposedly improves the speed of Fourier
> transforms get up to "a tenfold increase in speed" depending upon
> circumstances. Hopefully this will get incorporated into our refinement
> programs.
>
> http://web.mit.ed
On Fri, Jan 20, 2012 at 9:37 AM, Jim Fairman wrote:
> New Fourier transform algorithm supposedly improves the speed of Fourier
> transforms get up to "a tenfold increase in speed" depending upon
> circumstances. Hopefully this will get incorporated into our refinement
> programs.
Perhaps if sour
New Fourier transform algorithm supposedly improves the speed of Fourier
transforms get up to "a tenfold increase in speed" depending upon
circumstances. Hopefully this will get incorporated into our refinement
programs.
http://web.mit.edu/newsoffice/2012/faster-fourier-transforms-0118.html
--
10 matches
Mail list logo
