diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 18:22:58 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 18:22:58 -0300 |
| commit | 752c9294955123ff94eccfadb464cf3819533f7d (patch) | |
| tree | 6a390b548d42a1b36d335bab9d01bfe9670b87c9 | |
| parent | 94600fe71027fd262f0bb8f152dcdb0474ec1897 (diff) | |
| download | code-752c9294955123ff94eccfadb464cf3819533f7d.tar.gz code-752c9294955123ff94eccfadb464cf3819533f7d.tar.bz2 code-752c9294955123ff94eccfadb464cf3819533f7d.zip | |
Tweaked iteration
| -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 cc42cba..add6ead 100644 --- a/log-fourier_integrator.cpp +++ b/log-fourier_integrator.cpp @@ -115,7 +115,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(Ȓₜ₊₁); |