diff options
Diffstat (limited to 'log-fourier_integrator.cpp')
| -rw-r--r-- | log-fourier_integrator.cpp | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp index 879580d..72eb96c 100644 --- a/log-fourier_integrator.cpp +++ b/log-fourier_integrator.cpp @@ -100,25 +100,22 @@ int main(int argc, char* argv[]) { std::vector<Complex> RddfCt = fft.fourier(RddfC, false); std::vector<Complex> dfCt = fft.fourier(dfC, true); - std::vector<Complex> Ĉₜ₊₁(N); std::vector<Complex> Ȓₜ₊₁(N); for (unsigned n = 0; n < N; n++) { Ȓₜ₊₁[n] = (1.0 + pow(β, 2) * RddfCt[n] * Ȓₜ[n]) / (μ + 1i * fft.ν(n)); - Ĉₜ₊₁[n] = (2 * Γ₀ * std::conj(Ȓₜ[n]) / (1 + pow(τ₀ * fft.ν(n), 2)) + pow(β, 2) * (RddfCt[n] * Ĉₜ[n] + dfCt[n] * std::conj(Ȓₜ[n]))) / (μ + 1i * fft.ν(n)); } std::vector<Real> Rₜ₊₁ = fft.inverse(Ȓₜ₊₁); - /* for (unsigned n = 0; n < N; n++) { RddfC[n] = Rₜ₊₁[n] * ddf(λ, p, s, Cₜ[n]); } RddfCt = fft.fourier(RddfC, false); + std::vector<Complex> Ĉₜ₊₁(N); for (unsigned n = 0; n < N; n++) { Ĉₜ₊₁[n] = (2 * Γ₀ * std::conj(Ȓₜ₊₁[n]) / (1 + pow(τ₀ * fft.ν(n), 2)) + pow(β, 2) * (RddfCt[n] * Ĉₜ[n] + dfCt[n] * std::conj(Ȓₜ₊₁[n]))) / (μ + 1i * fft.ν(n)); } - */ std::vector<Real> Cₜ₊₁ = fft.inverse(Ĉₜ₊₁); μ *= pow(tanh(Cₜ₊₁[0]-1)+1, 0.05); |