diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:41:31 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:41:31 -0300 |
| commit | db0008dbd2d250b6688f07743770c09d58c88e43 (patch) | |
| tree | ac6b18e7fe7578072fb884da334880da71298b22 | |
| parent | 442b83dbe83f1a05956f871f97129123f36f75f1 (diff) | |
| download | code-db0008dbd2d250b6688f07743770c09d58c88e43.tar.gz code-db0008dbd2d250b6688f07743770c09d58c88e43.tar.bz2 code-db0008dbd2d250b6688f07743770c09d58c88e43.zip | |
More tweaks
| -rw-r--r-- | log-fourier_integrator.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp index 21b672c..60bdc76 100644 --- a/log-fourier_integrator.cpp +++ b/log-fourier_integrator.cpp @@ -172,7 +172,7 @@ int main(int argc, char* argv[]) { /* We found an upper bound */ μ₂ = μ; } - μ *= sqrt(sqrt(std::tanh(Cₜ[0]-1)+1)); + μ *= sqrt(sqrt(0.1*std::tanh(Cₜ[0]-1)+1)); } else { /* Once the bounds are set, we can use bisection */ if (Cₜ[0] > 1) { |