Now looks for Stokes lines at an increasing radius from a small initial radius, independant of N.

1 files changed, 3 insertions, 3 deletions

diff --git a/mixedStokes.cpp b/mixedStokes.cpp
index 09a75b2..a437ff3 100644
--- a/mixedStokes.cpp
+++ b/mixedStokes.cpp
@@ -13,7 +13,7 @@ int main(int argc, char* argv[]) {
   unsigned N = 10; // number of spins
   // simulation parameters
   Real ε = 1e-15;
-  Real δ = 1;
+  Real δz₀ = 1e-3;
   unsigned n = 10;
   bool useMinima = false;
 
@@ -28,7 +28,7 @@ int main(int argc, char* argv[]) {
       ε = atof(optarg);
       break;
     case 'd':
-      δ = atof(optarg);
+      δz₀ = atof(optarg);
       break;
     case 'n':
       n = atof(optarg);
@@ -45,7 +45,7 @@ int main(int argc, char* argv[]) {
 
   for (unsigned i = 0; i < n; i++) {
     auto tag = std::chrono::high_resolution_clock::now();
-    collectStokesData<2, 4>(std::to_string(tag.time_since_epoch().count()), N, r.engine(), ε, δ, useMinima, 1.0, 0.01);
+    collectStokesData<2, 4>(std::to_string(tag.time_since_epoch().count()), N, r.engine(), ε, δz₀, useMinima, 1.0, 0.01);
   }
 
   return 0;