ToolPythonAdvanced
numpy.fft.irfft2
Python. Called in 2 tutorials; each line below leads to its place in the tutorial.
ToolPythonIntermediate
Cahn-Hilliard with a semi-implicit spectral step: how fast domains grow
- lap = irfft2(-k2 * rfft2(f), s=f.shape)
- c = irfft2(ch - dt * (k2 * rfft2(c**3 - c) + KAPPA * k2**2 * ch), s=c.shape)
- c = irfft2(ch, s=(N, N))
- c_2, c_05 = irfft2(ch_2, s=(N, N)), irfft2(ch_05, s=(N, N))
- snaps[snap_steps[n]] = (irfft2(ch, s=(N, N)), ch.copy())
- jump = np.abs(irfft2(ch_p - ch_prev, s=(N, N))).max()
and 1 more line in this tutorial