summaryrefslogtreecommitdiff
path: root/log-fourier_integrator.cpp
diff options
context:
space:
mode:
authorJaron Kent-Dobias <jaron@kent-dobias.com>2025-04-19 16:57:25 -0300
committerJaron Kent-Dobias <jaron@kent-dobias.com>2025-04-19 16:57:25 -0300
commitd78a80777e53339aae3de04caf93aa1307ee69c7 (patch)
treecac427c1a63c4d9a8e8707b8cbe277dbc0e1e968 /log-fourier_integrator.cpp
parent3d16c421c10adf44937a243002270bf786a812aa (diff)
downloadcode-d78a80777e53339aae3de04caf93aa1307ee69c7.tar.gz
code-d78a80777e53339aae3de04caf93aa1307ee69c7.tar.bz2
code-d78a80777e53339aae3de04caf93aa1307ee69c7.zip
Start from β = 0 again
Diffstat (limited to 'log-fourier_integrator.cpp')
-rw-r--r--log-fourier_integrator.cpp5
1 files changed, 2 insertions, 3 deletions
diff --git a/log-fourier_integrator.cpp b/log-fourier_integrator.cpp
index 110b9e4..ebd161b 100644
--- a/log-fourier_integrator.cpp
+++ b/log-fourier_integrator.cpp
@@ -87,7 +87,6 @@ int main(int argc, char* argv[]) {
Real β = 0;
while (β < βₘₐₓ) {
- β += Δβ;
Real μ₁ = 0;
Real μ₂ = 0;
while (true) {
@@ -160,11 +159,10 @@ int main(int argc, char* argv[]) {
/* Once the bounds are set, we can use bisection */
if (Cₜ[0] > 1) {
μ₁ = μ;
- μ = μ₁ + (μ₂ - μ₁) / 2;
} else {
μ₂ = μ;
- μ = μ₁ + (μ₂ - μ₁) / 2;
}
+ μ = (μ₁ + μ₂) / 2;
}
}
@@ -185,6 +183,7 @@ int main(int argc, char* argv[]) {
E *= β;
std::cerr << β << " " << μ << " " << Ĉₜ[0].real() << " " << E << " " << γ << std::endl;
+ β += Δβ;
}
for (unsigned i = 0; i < N; i++) {