Faster approach to μ

1 files changed, 1 insertions, 1 deletions

diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp
index bc53f99..cc42cba 100644
--- a/log-fourier_integrator.cpp
+++ b/log-fourier_integrator.cpp
@@ -176,7 +176,7 @@ int main(int argc, char* argv[]) {
           /* We found an upper bound */
           μ₂ = μ;
         }
-        μ *= sqrt(sqrt(fac*std::tanh(Cₜ[0]-1)+1));
+        μ *= fac*std::tanh(Cₜ[0]-1)+1;
       } else {
         /* Once the bounds are set, we can use bisection */
         if (Cₜ[0] > 1) {