From d668bb5cf10c30871bf1bfe6ba0130cb3abe1f59 Mon Sep 17 00:00:00 2001
From: Jaron Kent-Dobias <jaron@kent-dobias.com>
Date: Wed, 25 Dec 2024 19:46:34 +0100
Subject: Allow for initial walking time, and record results differently.

---
 walk.cpp | 26 +++++++++++++++++++-------
 1 file changed, 19 insertions(+), 7 deletions(-)

diff --git a/walk.cpp b/walk.cpp
index 7c5d01c..ab4dbd3 100644
--- a/walk.cpp
+++ b/walk.cpp
@@ -102,12 +102,14 @@ Vector randomStep(const QuadraticModel& M, const Vector& x₀, Real E, Rng& r, R
 
 int main(int argc, char* argv[]) {
   unsigned N = 10;
-  unsigned steps = 10;
+  Real T = 10;
+  Real T₀ = 2;
   Real E = 0;
+  Real Δt = 1e-4;
 
   int opt;
 
-  while ((opt = getopt(argc, argv, "N:E:n:")) != -1) {
+  while ((opt = getopt(argc, argv, "N:E:T:t:I:")) != -1) {
     switch (opt) {
     case 'N':
       N = (unsigned)atof(optarg);
@@ -115,8 +117,14 @@ int main(int argc, char* argv[]) {
     case 'E':
       E = atof(optarg);
       break;
-    case 'n':
-      steps = (unsigned)atof(optarg);
+    case 'T':
+      T = atof(optarg);
+      break;
+    case 'I':
+      T₀ = atof(optarg);
+      break;
+    case 't':
+      Δt = atof(optarg);
       break;
     default:
       exit(1);
@@ -135,11 +143,15 @@ int main(int argc, char* argv[]) {
 
   std::cout << std::setprecision(15);
 
+  for (Real t = 0; t < T₀; t += Δt) {
+    x₀ = randomStep(ls, x₀, E, r, Δt);
+  }
+
   Vector x = x₀;
 
-  for (unsigned step = 0; step < steps; step++) {
-    x = randomStep(ls, x, E, r);
-    std::cout << ls.H(x) / N << " " << x.dot(x₀) / N << std::endl;
+  for (Real t = 0; t < T; t += Δt) {
+    std::cout << t << " " << x.dot(x₀) / N << std::endl;
+    x = randomStep(ls, x, E, r, Δt);
   }
 
   return 0;
-- 
cgit v1.2.3-70-g09d2