diff options
| -rw-r--r-- | log-fourier.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/log-fourier.cpp b/log-fourier.cpp index 6149e6f..3ffa3c6 100644 --- a/log-fourier.cpp +++ b/log-fourier.cpp @@ -40,7 +40,7 @@ Real LogarithmicFourierTransform::ν(unsigned n) const { return exp(ω(n)); } -Complex gamma(Complex z) { +Complex Γ(Complex z) { gsl_sf_result logΓ; gsl_sf_result argΓ; @@ -66,7 +66,7 @@ std::vector<Complex> LogarithmicFourierTransform::fourier(const std::vector<Real } fftw_execute(a_to_â); for (unsigned n = 0; n < pad*N; n++) { - â[(pad*N / 2 + n) % (pad*N)] *= pow(1i * σ, 1i * s(n) - k) * gamma(k - 1i * s(n)); + â[(pad*N / 2 + n) % (pad*N)] *= pow(1i * σ, 1i * s(n) - k) * Γ(k - 1i * s(n)); } fftw_execute(â_to_a); for (unsigned n = 0; n < N; n++) { @@ -90,7 +90,7 @@ std::vector<Real> LogarithmicFourierTransform::inverse(const std::vector<Complex } fftw_execute(a_to_â); for (unsigned n = 0; n < pad*N; n++) { - â[(pad*N / 2 + n) % (pad*N)] *= pow(-1i * σ, 1i * s(n) - k) * gamma(k - 1i * s(n)); + â[(pad*N / 2 + n) % (pad*N)] *= pow(-1i * σ, 1i * s(n) - k) * Γ(k - 1i * s(n)); } fftw_execute(â_to_a); for (unsigned n = 0; n < N; n++) { |