diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:37:39 -0300 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2025-04-19 17:37:39 -0300 |
| commit | daa25bf89cb7adcd7136abe93e1d81e1ede6ce27 (patch) | |
| tree | c6246fcf6fb8daa29cc21398eace7090647d38f2 | |
| parent | 0c08fa2b2dc82cbbd2e6bb4ceb201f337961a75b (diff) | |
| download | code-daa25bf89cb7adcd7136abe93e1d81e1ede6ce27.tar.gz code-daa25bf89cb7adcd7136abe93e1d81e1ede6ce27.tar.bz2 code-daa25bf89cb7adcd7136abe93e1d81e1ede6ce27.zip | |
More sqrts
| -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 3049bd5..dc4f48f 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(Cₜ[0]); + μ *= sqrt(sqrt(Cₜ[0])); } else { /* Once the bounds are set, we can use bisection */ if (Cₜ[0] > 1) { |