http://ergodicity.iamganesh.com/2007/03/22/ginzburg-landau/ Quick brown foxes and lazy dogs. Fri, 21 Nov 2008 12:39:00 +0000 http://wordpress.org/?v=2.6.2 http://ergodicity.iamganesh.com/2007/03/22/ginzburg-landau/#comment-3942 Math Conference » Ganesh Swami Mon, 23 Jul 2007 03:18:10 +0000 http://ergodicity.iamganesh.com/2007/03/22/ginzburg-landau/#comment-3942 <p>[...] Giraffes for example. The model is based on Reaction-Diffusion systems, which I had studied in the Ginzburg-Landau equation. The Ginzburg-Landau equation also forms patterns when carbon monooxide diffuses and [...]</p> [...] Giraffes for example. The model is based on Reaction-Diffusion systems, which I had studied in the Ginzburg-Landau equation. The Ginzburg-Landau equation also forms patterns when carbon monooxide diffuses and [...]

]]> http://ergodicity.iamganesh.com/2007/03/22/ginzburg-landau/#comment-3062 Algorithm Leadership » Ganesh Swami Mon, 09 Apr 2007 18:13:37 +0000 http://ergodicity.iamganesh.com/2007/03/22/ginzburg-landau/#comment-3062 <p>[...] On a similar note, I’m having doubts about a PDE solver that I’m writing for my course project. I’m implementing the Pseodo-Spectral Method for the space dynamics. The technique is quite simply a projection onto another basis that requires fewer coefficients in the series expansion. At each time step, I take the forward and backward fourier transform of the space variables. This might have made sense a few years back when the algorithmic complexity of the FFT beats a space convolution hands down, but the added code complexity is probably not worth it. The only reason I’m doing it now is because I’ve never done anything like this before and it’s pretty cool. [...]</p> [...] On a similar note, I’m having doubts about a PDE solver that I’m writing for my course project. I’m implementing the Pseodo-Spectral Method for the space dynamics. The technique is quite simply a projection onto another basis that requires fewer coefficients in the series expansion. At each time step, I take the forward and backward fourier transform of the space variables. This might have made sense a few years back when the algorithmic complexity of the FFT beats a space convolution hands down, but the added code complexity is probably not worth it. The only reason I’m doing it now is because I’ve never done anything like this before and it’s pretty cool. [...]

]]>