From 94600fe71027fd262f0bb8f152dcdb0474ec1897 Mon Sep 17 00:00:00 2001
From: Jaron Kent-Dobias <jaron@kent-dobias.com>
Date: Sat, 19 Apr 2025 18:12:44 -0300
Subject: Faster approach to μ
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 log-fourier_integrator.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'log-fourier_integrator.cpp')

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) {
-- 
cgit v1.2.3-70-g09d2