summaryrefslogtreecommitdiff
path: root/log-fourier_integrator.cpp
diff options
context:
space:
mode:
authorJaron Kent-Dobias <jaron@kent-dobias.com>2025-04-19 18:24:53 -0300
committerJaron Kent-Dobias <jaron@kent-dobias.com>2025-04-19 18:24:53 -0300
commitdeb3a6da754c7e231cea29b58de776ae2a44fe26 (patch)
tree34c74601b5c2caed9d8ca23ea5d01081cd1f4d63 /log-fourier_integrator.cpp
parent752c9294955123ff94eccfadb464cf3819533f7d (diff)
downloadcode-deb3a6da754c7e231cea29b58de776ae2a44fe26.tar.gz
code-deb3a6da754c7e231cea29b58de776ae2a44fe26.tar.bz2
code-deb3a6da754c7e231cea29b58de776ae2a44fe26.zip
Back to other iterate
Diffstat (limited to 'log-fourier_integrator.cpp')
-rw-r--r--log-fourier_integrator.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp
index add6ead..f875254 100644
--- a/log-fourier_integrator.cpp
+++ b/log-fourier_integrator.cpp
@@ -100,22 +100,22 @@ int main(int argc, char* argv[]) {
Real ΔC₀ = 100;
unsigned it = 0;
while (ΔC > ε) {
- std::vector<Real> dfC(N);
+// std::vector<Real> dfC(N);
std::vector<Real> RddfC(N);
for (unsigned n = 0; n < N; n++) {
RddfC[n] = Rₜ[n] * ddf(λ, p, s, Cₜ[n]);
- dfC[n] = df(λ, p, s, Cₜ[n]);
+// dfC[n] = df(λ, p, s, Cₜ[n]);
}
std::vector<Complex> RddfCt = fft.fourier(RddfC, false);
- std::vector<Complex> dfCt = fft.fourier(dfC, true);
+// 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 * Γ₀ * Ȓₜ₊₁[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 * Γ₀ * Ȓₜ₊₁[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));
}
std::vector<Real> Rₜ₊₁ = fft.inverse(Ȓₜ₊₁);