summaryrefslogtreecommitdiff
path: root/src/fracture.cpp
blob: fb51d3eb21969905ef82d1c4089eabe841dde8d5 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

#include <random>
#include <iostream>

#include <cholmod.h>

#include "randutils/randutils.hpp"

#include <graph.hpp>
#include <network.hpp>
#include <hooks.hpp>
#include "measurements.hpp"

#include <csignal>
#include <cstring>
#include <atomic>

std::atomic<bool> quit(false);    // signal flag

void got_signal(int) {
    quit.store(true);
}

int main(int argc, char* argv[]) {
  struct sigaction sa;
  memset( &sa, 0, sizeof(sa) );
  sa.sa_handler = got_signal;
  sigfillset(&sa.sa_mask);
  sigaction(SIGINT, &sa, NULL);

  int opt;

  unsigned N = 1;
  double Lx = 16;
  double Ly = 16;
  double  beta = 0.5;

  unsigned n = 128;
  double a = 1.0;
  bool use_aN = false;

  while ((opt = getopt(argc, argv, "N:X:Y:b:n:a:")) != -1) {
    switch (opt) {
      case 'N':
        N = (unsigned)atof(optarg);
        break;
      case 'X':
        Lx = atof(optarg);
        break;
      case 'Y':
        Ly = atof(optarg);
        break;
      case 'b':
        beta = atof(optarg);
        break;
      case 'n':
        n = (unsigned)atof(optarg);
        use_aN = true;
        break;
      case 'a':
        a = atof(optarg);
        use_aN = true;
        break;
      default:
        exit(1);
    }
  }

  cholmod_common c;
  CHOL_F(start)(&c);

  randutils::auto_seed_128 seeds;
  std::mt19937 rng{seeds};

  if (use_aN) {
    unsigned Mx = (unsigned)4*sqrt(2*n*a);
    unsigned My = (unsigned)4*sqrt(2*n/a);

    ma meas(n, a, Mx, My, beta);

    for (unsigned trial = 0; trial < N; trial++) {
      while (true) {
        try {
          graph G(n, a, rng);
          elastic_network fuse_network(G, &c);
          fuse_network.set_thresholds(beta, rng);
          fuse_network.fracture(meas);
          break;
        } catch (std::exception &e) {
          std::cout << e.what() << '\n';
        }
      }

      if (quit.load())
        break;
    }
  } else {
    // fourier transforms of powers of two are faster
    unsigned Mx = pow(2, ceil(log2(4*Lx)));
    unsigned My = pow(2, ceil(log2(4*Ly)));

    ma meas(Lx, Ly, Mx, My, beta);

    for (unsigned trial = 0; trial < N; trial++) {
      while (true) {
        try {
          graph G(Lx, Ly, rng);
          elastic_network fuse_network(G, &c);
          fuse_network.set_thresholds(beta, rng);
          fuse_network.fracture(meas);
          break;
        } catch (std::exception &e) {
          std::cout << e.what() << '\n';
        }
      }

      if (quit.load())
        break;
    }
  }

  CHOL_F(finish)(&c);

  return 0;
}