diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:40:10 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:40:10 -0300 |
| commit | 442b83dbe83f1a05956f871f97129123f36f75f1 (patch) | |
| tree | 27e59c5eb049c2041c11c6676378afba2cde3c79 /log-fourier_integrator.cpp | |
| parent | daa25bf89cb7adcd7136abe93e1d81e1ede6ce27 (diff) | |
| download | code-442b83dbe83f1a05956f871f97129123f36f75f1.tar.gz code-442b83dbe83f1a05956f871f97129123f36f75f1.tar.bz2 code-442b83dbe83f1a05956f871f97129123f36f75f1.zip | |
New way to regularize the factor
Diffstat (limited to 'log-fourier_integrator.cpp')
| -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 dc4f48f..21b672c 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(Cₜ[0])); + μ *= sqrt(sqrt(std::tanh(Cₜ[0]-1)+1)); } else { /* Once the bounds are set, we can use bisection */ if (Cₜ[0] > 1) { |