diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:09:39 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:09:39 -0300 |
| commit | 0d6f6739000b69a53c61438fec3be41323313120 (patch) | |
| tree | 9e34f475cdce915b3143913fbaa135da958767e8 | |
| parent | be2aa67bc39d2e0b895738a94f24d5e89548f653 (diff) | |
| download | code-0d6f6739000b69a53c61438fec3be41323313120.tar.gz code-0d6f6739000b69a53c61438fec3be41323313120.tar.bz2 code-0d6f6739000b69a53c61438fec3be41323313120.zip | |
Iteration tweak
| -rw-r--r-- | log-fourier_integrator.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp index d7486e4..d6d23b3 100644 --- a/log-fourier_integrator.cpp +++ b/log-fourier_integrator.cpp @@ -109,7 +109,7 @@ int main(int argc, char* argv[]) { for (unsigned n = 0; n < N; n++) { Ȓₜ₊₁[n] = (1.0 + pow(β, 2) * RddfCt[n] * Ȓₜ[n]) / (μ + 1i * fft.ν(n)); // Ĉₜ₊₁[n] = - 2 * Γ₀ * Ȓₜ₊₁[n].imag() / (1 + pow(τ₀ * fft.ν(n), 2)) / 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)); + Ĉₜ₊₁[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(Ȓₜ₊₁); |