diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-20 00:32:46 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-20 00:32:46 -0300 |
| commit | 48e3caa0152e0606ce10157b9bd61431117baae6 (patch) | |
| tree | d86a9dce6790bf29fa5b23c7d1f8221547ad8600 /log-fourier_integrator.cpp | |
| parent | 70101b6e893f2260216a8e5a1ea41ec22d118110 (diff) | |
| download | code-48e3caa0152e0606ce10157b9bd61431117baae6.tar.gz code-48e3caa0152e0606ce10157b9bd61431117baae6.tar.bz2 code-48e3caa0152e0606ce10157b9bd61431117baae6.zip | |
Fixed serious mistake in log inverse transform
Diffstat (limited to 'log-fourier_integrator.cpp')
| -rw-r--r-- | log-fourier_integrator.cpp | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp index 531565c..f0c5649 100644 --- a/log-fourier_integrator.cpp +++ b/log-fourier_integrator.cpp @@ -111,8 +111,6 @@ 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)); } std::vector<Real> Rₜ₊₁ = fft.inverse(Ȓₜ₊₁); @@ -176,7 +174,7 @@ int main(int argc, char* argv[]) { + (2 - h₂ₙ / h₂ₙ₊₁) * f₂ₙ₊₂ ); } - E *= β; +// E *= β; std::cerr << "\x1b[2K" << "\r"; std::cerr << β << " " << μ << " " << Ĉₜ[0].real() << " " << E << " " << γ << std::endl; |