forked from tan2/DynEarthSol-old
-
Notifications
You must be signed in to change notification settings - Fork 3
/
bc.cxx
1617 lines (1425 loc) · 54.3 KB
/
bc.cxx
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifdef USE_NPROF
#include <nvToolsExt.h>
#endif
#include <iostream>
#include <unordered_map>
#include <iomanip>
#include <math.h>
#include "constants.hpp"
#include "parameters.hpp"
#include "matprops.hpp"
#include "markerset.hpp"
#include "barycentric-fn.hpp"
#include "geometry.hpp"
#include "utils.hpp"
#include "bc.hpp"
namespace {
//#pragma acc routine seq
void normal_vector_of_facet(int f, const int *conn, const array_t &coord,
double *normal, double &zcenter)
{
int n0 = conn[NODE_OF_FACET[f][0]];
int n1 = conn[NODE_OF_FACET[f][1]];
#ifdef THREED
int n2 = conn[NODE_OF_FACET[f][2]];
// vectors: n0-n1 and n0-n2
double v01[NDIMS], v02[NDIMS];
for (int i=0; i<NDIMS; ++i) {
v01[i] = coord[n1][i] - coord[n0][i];
v02[i] = coord[n2][i] - coord[n0][i];
}
// the outward normal vector is parallel to the cross product
// of v01 and v02, with magnitude = area of the triangle
normal[0] = (v01[1] * v02[2] - v01[2] * v02[1]) / 2;
normal[1] = (v01[2] * v02[0] - v01[0] * v02[2]) / 2;
normal[2] = (v01[0] * v02[1] - v01[1] * v02[0]) / 2;
zcenter = (coord[n0][2] + coord[n1][2] + coord[n2][2]) / NODES_PER_FACET;
#else
// the edge vector
double v01[NDIMS];
for (int i=0; i<NDIMS; ++i) {
v01[i] = coord[n1][i] - coord[n0][i];
}
// the normal vector to the edge, pointing outward
normal[0] = v01[1];
normal[1] = -v01[0];
zcenter = (coord[n0][1] + coord[n1][1]) / NODES_PER_FACET;
#endif
}
}
#pragma acc routine seq
bool is_on_boundary(const uint_vec &bcflag, int node)
{
uint flag = bcflag[node];
return flag & BOUND_ANY;
}
double find_max_vbc(const BC &bc)
{
double max_vbc_val = 1e-12; // equal to 0.03 mm/yr
if (bc.vbc_x0 % 2 == 1) // odd number indicates fixed velocity component
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_x0));
if (bc.vbc_x1 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_x1));
if (bc.vbc_y0 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_y0));
if (bc.vbc_y1 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_y1));
if (bc.vbc_z0 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_z0));
if (bc.vbc_z1 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_z1));
if (bc.vbc_n0 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_n0));
if (bc.vbc_n1 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_n1));
if (bc.vbc_n2 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_n2));
if (bc.vbc_n3 % 2 == 1)
max_vbc_val = std::max(max_vbc_val, std::fabs(bc.vbc_val_n3));
return max_vbc_val;
}
void create_boundary_normals(const Variables &var, array_t &bnormals,
std::map<std::pair<int,int>, double*> &edge_vectors)
{
/* This subroutine finds the outward normal unit vectors of boundaries.
* There are two types of boundaries: ibound{x,y,z}? and iboundn?.
* The first type ibound{x,y,z}? has well defined "normal" direction
* as their name implied. Thus they can be curved. (Ex. the top boundary
* can have topography.)
* The second type iboundn?, on the other hand, must be a plane so that
* their vbc are well defined.
*
* If the normal component of the boundary velocity is fixed, the boundary
* normal will not change with time.
*/
for (int i=0; i<nbdrytypes; i++) {
double normal[NDIMS] = {0};
if (var.bfacets[i]->size() == 0) continue;
for (auto j=var.bfacets[i]->begin(); j<var.bfacets[i]->end(); ++j) {
int e = j->first;
int f = j->second;
double tmp;
normal_vector_of_facet(f, (*var.connectivity)[e], *var.coord,
normal, tmp);
// make an unit vector
double len = 0;
for(int d=0; d<NDIMS; d++)
len += normal[d] * normal[d];
len = std::sqrt(len);
for(int d=0; d<NDIMS; d++)
normal[d] = normal[d] / len;
if (j == var.bfacets[i]->begin()) {
for(int d=0; d<NDIMS; d++)
bnormals[i][d] = normal[d];
if (i < iboundn0) break; // slant boundaries start at iboundn0, other boundary can be curved
}
else {
// Make sure the boundary is a plane, ie. all facets have the same normal vector.
const double eps2 = 1e-12;
double diff2 = 0;
for(int d=0; d<NDIMS; d++)
diff2 += (bnormals[i][d] - normal[d]) * (bnormals[i][d] - normal[d]);
if (diff2 > eps2) {
std::cerr << "Error: boundary " << i << " is curved.\n";
std::cerr << "Got - Expected\n";
std::cerr << bnormals[i][0] << " - " << normal[0] << '\n';
std::cerr << bnormals[i][1] << " - " << normal[1] << '\n';
#ifdef THREED
std::cerr << bnormals[i][2] << " - " << normal[2] << '\n';
#endif
std::exit(1);
}
}
}
}
for (int i=0; i<nbdrytypes; i++) {
if (var.bfacets[i]->size() == 0) continue;
const double eps = 1e-15;
for (int j=i+1; j<nbdrytypes; j++) {
if (var.bfacets[j]->size() == 0) continue;
double *s = new double[NDIMS]; // intersection of two boundaries
// whole-application lifetime, no need to delete manually
#ifdef THREED
// quick path: both walls are vertical
if (std::abs((*var.bnormals)[i][NDIMS-1]) < eps &&
std::abs((*var.bnormals)[j][NDIMS-1]) < eps) {
s[0] = s[1] = 0;
s[NDIMS-1] = 1;
}
else {
// cross product of 2 normal vectors
s[0] = (*var.bnormals)[i][1]*(*var.bnormals)[j][2] - (*var.bnormals)[i][2]*(*var.bnormals)[j][1];
s[1] = (*var.bnormals)[i][2]*(*var.bnormals)[j][0] - (*var.bnormals)[i][0]*(*var.bnormals)[j][2];
s[2] = (*var.bnormals)[i][0]*(*var.bnormals)[j][1] - (*var.bnormals)[i][1]*(*var.bnormals)[j][0];
}
#else
// 2D
s[0] = 0;
s[1] = 1;
#endif
edge_vectors[std::make_pair(i, j)] = s;
}
}
}
void apply_vbcs(const Param ¶m, const Variables &var, array_t &vel)
{
#ifdef USE_NPROF
nvtxRangePushA(__FUNCTION__);
#endif
// meaning of vbc flags (odd: free; even: fixed) --
// 0: all components free
// 1: normal component fixed, shear components free
// 2: normal component free, shear components fixed at 0
// 3: normal component fixed, shear components fixed at 0
// 4: normal component free, shear component (not z) fixed, only in 3D
// 5: normal component fixed at 0, shear component (not z) fixed, only in 3D
const BC &bc = param.bc;
#ifdef THREED
// vel period is not ready for 3D
#else
// new way to find vbc_applied_x
double t_now = var.time / YEAR2SEC;
double vbc_applied_x0 = bc.vbc_val_x0 * interp1(bc.vbc_period_x0_time_in_yr,bc.vbc_period_x0_ratio, t_now);
double vbc_applied_x1 = bc.vbc_val_x1 * interp1(bc.vbc_period_x1_time_in_yr,bc.vbc_period_x1_ratio, t_now);
// find max and min coordinate for BOUNDX0
double BOUNDX0_max = 0.;
double BOUNDX0_min = 0.;
double BOUNDX1_max = 0.;
double BOUNDX1_min = 0.;
bool if_init0 = false;
bool if_init1 = false;
for (int i=0; i<var.nnode; ++i) {
if (! is_on_boundary(*var.bcflag, i)) continue;
uint flag = (*var.bcflag)[i];
if (flag & BOUNDX0) {
const double *x = (*var.coord)[i];
if (!if_init0) {
BOUNDX0_max = x[1];
BOUNDX0_min = x[1];
if_init0 = true;
} else {
if (x[1]>BOUNDX0_max) {
BOUNDX0_max = x[1];
}
if (x[1]<BOUNDX0_min) {
BOUNDX0_min = x[1];
}
}
} else if (flag & BOUNDX1) {
const double *x = (*var.coord)[i];
if (!if_init1) {
BOUNDX1_max = x[1];
BOUNDX1_min = x[1];
if_init1 = true;
} else {
if (x[1]>BOUNDX1_max) {
BOUNDX1_max = x[1];
}
if (x[1]<BOUNDX1_min) {
BOUNDX1_min = x[1];
}
}
}
}
double BOUNDX0_width = BOUNDX0_max - BOUNDX0_min;
double BOUNDX1_width = BOUNDX1_max - BOUNDX1_min;
const double_vec& vbc_vertical_ratios_x0 = var.vbc_vertical_ratio_x0;
const double_vec& vbc_vertical_ratios_x1 = var.vbc_vertical_ratio_x1;
double_vec vbc_vertical_divisions_x0(4,0.);
double_vec vbc_vertical_divisions_x1(4,0.);
for (int i=0;i<4;i++) {
vbc_vertical_divisions_x0[i] = - (BOUNDX0_max - var.vbc_vertical_div_x0[i] * BOUNDX0_width);
vbc_vertical_divisions_x1[i] = - (BOUNDX0_max - var.vbc_vertical_div_x1[i] * BOUNDX0_width);
}
#endif
// diverging x-boundary
const std::map<std::pair<int,int>, double*> *edgevec = &(var.edge_vectors);
int bc_x0 = bc.vbc_x0;
int bc_x1 = bc.vbc_x1;
int bc_y0 = bc.vbc_y0;
int bc_y1 = bc.vbc_y1;
int bc_z0 = bc.vbc_z0;
int bc_z1 = bc.vbc_z1;
double bc_vx0 = bc.vbc_val_x0;
double bc_vx1 = bc.vbc_val_x1;
double bc_vy0 = bc.vbc_val_y0;
double bc_vy1 = bc.vbc_val_y1;
double bc_vz0 = bc.vbc_val_z0;
double bc_vz1 = bc.vbc_val_z1;
double bc_vx0min = bc.vbc_val_division_x0_min;
double bc_vx0max = bc.vbc_val_division_x0_max;
double bc_vx0r0 = bc.vbc_val_x0_ratio0;
double bc_vx0r1 = bc.vbc_val_x0_ratio1;
double bc_vx0r2 = bc.vbc_val_x0_ratio2;
#ifdef THREED
#pragma acc parallel loop
#else
double zmin = 0;
for (int k=0; k<var.nnode; ++k) {
double* tmpx = (*var.coord)[k];
if ( tmpx[NDIMS-1] < zmin )
zmin = tmpx[NDIMS-1];
}
#pragma acc parallel loop
#endif
for (int i=0; i<var.nnode; ++i) {
// fast path: skip nodes not on boundary
if (! is_on_boundary(*var.bcflag, i)) continue;
uint flag = (*var.bcflag)[i];
double *v = vel[i];
#ifdef THREED
#else
const double *x = (*var.coord)[i];
double ratio, rr, dvr;
double vbc_exact_x0 = vbc_applied_x0 * interp1(vbc_vertical_divisions_x0, vbc_vertical_ratios_x0,-x[1]);
double vbc_exact_x1 = vbc_applied_x1 * interp1(vbc_vertical_divisions_x1, vbc_vertical_ratios_x1,-x[1]);
#endif
//
// X
//
if (flag & BOUNDX0) {
switch (bc_x0) {
case 0:
break;
case 1:
#ifdef THREED
v[0] = bc_vx0;
#else
v[0] = vbc_exact_x0;
#endif
break;
case 2:
v[1] = 0;
#ifdef THREED
v[2] = 0;
#endif
break;
case 3:
#ifdef THREED
v[0] = bc_vx0;
#else
v[0] = vbc_exact_x0;
if (bc.bottom_shear_zone_thickness > 0.) {
double dz = x[NDIMS-1] - zmin;
if (dz < bc.bottom_shear_zone_thickness)
v[0] = v[0] * dz / bc.bottom_shear_zone_thickness;
}
#endif
v[1] = 0;
#ifdef THREED
v[2] = 0;
#endif
break;
#ifdef THREED
case 4:
v[1] = bc_vx0;
v[2] = 0;
break;
case 5:
v[0] = 0;
v[1] = bc_vx0;
v[2] = 0;
break;
case 7:
v[0] = bc_vx0;
v[1] = 0;
break;
#endif
}
}
if (flag & BOUNDX1) {
switch (bc_x1) {
case 0:
break;
case 1:
#ifdef THREED
v[0] = bc_vx1;
#else
v[0] = vbc_exact_x1;
#endif
break;
case 2:
v[1] = 0;
#ifdef THREED
v[2] = 0;
#endif
break;
case 3:
#ifdef THREED
v[0] = bc_vx1;
#else
v[0] = vbc_exact_x1;
#endif
v[1] = 0;
#ifdef THREED
v[2] = 0;
#endif
break;
#ifdef THREED
case 4:
v[1] = bc_vx1;
v[2] = 0;
break;
case 5:
v[0] = 0;
v[1] = bc_vx1;
v[2] = 0;
break;
case 7:
v[0] = bc_vx1;
v[1] = 0;
break;
#endif
}
}
#ifdef THREED
//
// Y
//
if (flag & BOUNDY0) {
switch (bc_y0) {
case 0:
break;
case 1:
v[1] = bc_vy0;
break;
case 2:
v[0] = 0;
v[2] = 0;
break;
case 3:
v[0] = 0;
v[1] = bc_vy0;
v[2] = 0;
break;
case 4:
v[0] = bc_vy0;
v[2] = 0;
break;
case 5:
v[0] = bc_vy0;
v[1] = 0;
v[2] = 0;
break;
case 7:
v[0] = 0;
v[1] = bc_vy0;
break;
}
}
if (flag & BOUNDY1) {
switch (bc_y1) {
case 0:
break;
case 1:
v[1] = bc_vy1;
break;
case 2:
v[0] = 0;
v[2] = 0;
break;
case 3:
v[0] = bc_vy1;
v[1] = 0;
v[2] = 0;
break;
case 4:
v[0] = bc_vy1;
v[2] = 0;
break;
case 5:
v[0] = bc_vy1;
v[1] = 0;
v[2] = 0;
break;
case 7:
v[0] = 0;
v[1] = bc_vy1;
break;
}
}
#endif
//
// N
//
for (int ib=iboundn0; ib<=iboundn3; ib++) {
const double eps = 1e-15;
const double *n = (*var.bnormals)[ib]; // unit normal vector
if (flag & (1 << ib)) {
double fac = 0;
switch (var.vbc_types[ib]) {
case 1:
if (flag == (1U << ib)) { // ordinary boundary
double vn = 0;
for (int d=0; d<NDIMS; d++)
vn += v[d] * n[d]; // normal velocity
for (int d=0; d<NDIMS; d++)
v[d] += (var.vbc_values[ib] - vn) * n[d]; // setting normal velocity
}
else { // intersection with another boundary
for (int ic=iboundx0; ic<ib; ic++) {
if (flag & (1 << ic)) {
if (var.vbc_types[ic] == 0) {
double vn = 0;
for (int d=0; d<NDIMS; d++)
vn += v[d] * n[d]; // normal velocity
for (int d=0; d<NDIMS; d++)
v[d] += (var.vbc_values[ib] - vn) * n[d]; // setting normal velocity
}
else if (var.vbc_types[ic] == 1) {
auto edge = edgevec->at(std::make_pair(ic, ib));
double ve = 0;
for (int d=0; d<NDIMS; d++)
ve += v[d] * edge[d];
for (int d=0; d<NDIMS; d++)
v[d] = ve * edge[d]; // v must be parallel to edge
}
}
}
}
break;
case 3:
for (int d=0; d<NDIMS; d++)
v[d] = var.vbc_values[ib] * n[d]; // v must be normal to n
break;
case 11:
fac = 1 / std::sqrt(1 - n[NDIMS-1]*n[NDIMS-1]); // factor for horizontal normal unit vector
if (flag == (1U << ib)) { // ordinary boundary
double vn = 0;
for (int d=0; d<NDIMS-1; d++)
vn += v[d] * n[d]; // normal velocity
for (int d=0; d<NDIMS-1; d++)
v[d] += (var.vbc_values[ib] * fac - vn) * n[d]; // setting normal velocity
}
else { // intersection with another boundary
for (int ic=iboundx0; ic<ib; ic++) {
if (flag & (1 << ic)) {
if (var.vbc_types[ic] == 0) {
double vn = 0;
for (int d=0; d<NDIMS-1; d++)
vn += v[d] * n[d]; // normal velocity
for (int d=0; d<NDIMS-1; d++)
v[d] += (var.vbc_values[ib] * fac - vn) * n[d]; // setting normal velocity
}
else if (var.vbc_types[ic] == 1) {
auto edge = edgevec->at(std::make_pair(ic, ib));
double ve = 0;
for (int d=0; d<NDIMS; d++)
ve += v[d] * edge[d];
for (int d=0; d<NDIMS; d++)
v[d] = ve * edge[d]; // v must be parallel to edge
}
}
}
}
break;
case 13:
fac = 1 / std::sqrt(1 - n[NDIMS-1]*n[NDIMS-1]); // factor for horizontal normal unit vector
for (int d=0; d<NDIMS-1; d++)
v[d] = var.vbc_values[ib] * fac * n[d];
v[NDIMS-1] = 0;
break;
}
}
}
//
// Z, must be dealt last
//
// fast path: vz is usually free in the models
if (bc_z0==0 && bc_z1==0) continue;
if (flag & BOUNDZ0) {
switch (bc_z0) {
case 0:
break;
case 1:
v[NDIMS-1] = bc_vz0;
break;
case 2:
v[0] = 0;
#ifdef THREED
v[1] = 0;
#endif
break;
case 3:
v[0] = 0;
#ifdef THREED
v[1] = 0;
#endif
v[NDIMS-1] = bc_vz0;
break;
}
}
if (flag & BOUNDZ1) {
switch (bc_z1) {
case 0:
break;
case 1:
v[NDIMS-1] = bc_vz1;
break;
case 2:
v[0] = 0;
#ifdef THREED
v[1] = 0;
#endif
break;
case 3:
v[0] = 0;
#ifdef THREED
v[1] = 0;
#endif
v[NDIMS-1] = bc_vz1;
break;
}
}
}
#ifdef USE_NPROF
nvtxRangePop();
#endif
}
void apply_stress_bcs(const Param& param, const Variables& var, array_t& force)
{
#ifdef USE_NPROF
nvtxRangePushA(__FUNCTION__);
#endif
// TODO: add general stress (Neumann) bcs
if (param.control.gravity == 0) return;
//
// Gravity-induced (hydrostatic and lithostatic) stress BCs
//
for (int i=0; i<nbdrytypes; i++) {
if (var.vbc_types[i] != 0 &&
var.vbc_types[i] != 2 &&
var.vbc_types[i] != 4) continue;
if (i==iboundz0 && !param.bc.has_winkler_foundation) continue;
if (i==iboundz1 && !param.bc.has_water_loading) continue;
const auto& bdry = *(var.bfacets[i]);
const int bound = static_cast<int>(bdry.size());
// loops over all bdry facets
#pragma acc parallel loop
for (int n=0; n<bound; ++n) {
// this facet belongs to element e
int e = bdry[n].first;
// this facet is the f-th facet of e
int f = bdry[n].second;
const int *conn = (*var.connectivity)[e];
// the outward-normal vector
double normal[NDIMS];
// the z-coordinate of the facet center
double zcenter;
normal_vector_of_facet(f, conn, *var.coord, normal, zcenter);
double p;
if (i==iboundz0 && param.bc.has_winkler_foundation) {
// Winkler foundation for the bottom boundary
p = var.compensation_pressure -
(var.mat->rho(e) + param.bc.winkler_delta_rho) *
param.control.gravity * (zcenter + param.mesh.zlength);
}
else if (i==iboundz1 && param.bc.has_water_loading) {
// hydrostatic water loading for the surface boundary
p = 0;
if (zcenter < param.control.surf_base_level) {
// below sea level
const double sea_water_density = 1030;
p = sea_water_density * param.control.gravity * (param.control.surf_base_level - zcenter);
}
}
else {
// sidewalls
p = ref_pressure(param, zcenter);
}
// lithostatc support - Archimed force (normal to the surface)
for (int j=0; j<NODES_PER_FACET; ++j) {
int nn = conn[NODE_OF_FACET[f][j]];
double *f = force[nn];
for (int d=0; d<NDIMS; ++d) {
#pragma acc atomic update
f[d] -= p * normal[d] / NODES_PER_FACET;
}
}
}
}
if (param.bc.has_elastic_foundation) {
/* A restoration force on the bottom nodes proportional to total vertical displacement */
for (auto i=var.bnodes[iboundz0]->begin(); i<var.bnodes[iboundz0]->end(); ++i) {
int n = *i;
force[n][NDIMS-1] -= param.bc.elastic_foundation_constant * ((*var.coord)[n][NDIMS-1] - (*var.coord0)[n][NDIMS-1]);
}
}
#ifdef USE_NPROF
nvtxRangePop();
#endif
}
namespace {
void simple_diffusion(const Variables& var)
{
#ifdef USE_NPROF
nvtxRangePushA(__FUNCTION__);
#endif
/* Diffusing surface topography to simulate the effect of erosion and
* sedimentation.
*/
const array_t& coord = *var.coord;
const SurfaceInfo& surfinfo = var.surfinfo;
const int_vec& top_nodes = *surfinfo.top_nodes;
const int top_bdry = iboundz1;
const auto& top = *(var.bfacets[top_bdry]);
const int ntop = surfinfo.ntop;
#ifdef USE_NPROF
nvtxRangePushA("prepare variable total_dx");
#endif
double *total_dx = var.surfinfo.total_dx->data();
#ifdef USE_NPROF
nvtxRangePop();
#endif
double *total_slope = var.surfinfo.total_slope->data();
double_vec& dh = *var.surfinfo.dh;
#pragma acc parallel loop
for (int i=0;i<var.nnode;i++) {
total_dx[i] = 0.;
total_slope[i] = 0.;
}
// loops over all top facets
#ifdef THREED
const size_t tsize = top.size();
#pragma acc parallel loop
for (std::size_t i=0; i<tsize; ++i) {
// this facet belongs to element e
int e = top[i].first;
// this facet is the f-th facet of e
int f = top[i].second;
const int *conn = (*var.connectivity)[e];
int n0 = (*var.connectivity)[e][NODE_OF_FACET[f][0]];
int n1 = (*var.connectivity)[e][NODE_OF_FACET[f][1]];
//#ifdef THREED
int n2 = (*var.connectivity)[e][NODE_OF_FACET[f][2]];
double projected_area;
{
// normal vector of this facet
double normal[NDIMS];
// two vectors n0-n1 and n0-n2
// n is the cross product of these two vectors
// the length of n is 2 * triangle area
double x01, y01, z01, x02, y02, z02;
x01 = coord[n1][0] - coord[n0][0];
y01 = coord[n1][1] - coord[n0][1];
z01 = coord[n1][2] - coord[n0][2];
x02 = coord[n2][0] - coord[n0][0];
y02 = coord[n2][1] - coord[n0][1];
z02 = coord[n2][2] - coord[n0][2];
normal[0] = y01*z02 - z01*y02;
normal[1] = z01*x02 - x01*z02;
normal[2] = x01*y02 - y01*x02;
/* the area of this facet is:
* 0.5 * std::sqrt(normal[0]*normal[0] + normal[1]*normal[1] + normal[2]*normal[2])
*
* theta is the angle between this facet and horizontal
* tan_theta = std::sqrt(normal[0]*normal[0] + normal[1]*normal[1]) / normal[2]
* cos_theta = normal[2] / (2 * area)
*
* the area projected on the horizontal plane is:
* projected_area = area * cos_theta = 0.5 * normal[2]
*/
projected_area = 0.5 * normal[2];
}
#pragma acc atomic update
total_dx[n0] += projected_area;
#pragma acc atomic update
total_dx[n1] += projected_area;
#pragma acc atomic update
total_dx[n2] += projected_area;
double shp2dx[NODES_PER_FACET], shp2dy[NODES_PER_FACET];
double iv = 1 / (2 * projected_area);
shp2dx[0] = iv * (coord[n1][1] - coord[n2][1]);
shp2dx[1] = iv * (coord[n2][1] - coord[n0][1]);
shp2dx[2] = iv * (coord[n0][1] - coord[n1][1]);
shp2dy[0] = iv * (coord[n2][0] - coord[n1][0]);
shp2dy[1] = iv * (coord[n0][0] - coord[n2][0]);
shp2dy[2] = iv * (coord[n1][0] - coord[n0][0]);
double D[NODES_PER_FACET][NODES_PER_FACET];
for (int j=0; j<NODES_PER_FACET; j++) {
for (int k=0; k<NODES_PER_FACET; k++) {
D[j][k] = (shp2dx[j] * shp2dx[k] +
shp2dy[j] * shp2dy[k]);
}
}
const int n[NODES_PER_FACET] = {n0, n1, n2};
for (int j=0; j<NODES_PER_FACET; j++) {
double slope = 0;
for (int k=0; k<NODES_PER_FACET; k++)
slope += D[j][k] * coord[n[k]][2];
#pragma acc atomic update
total_slope[n[j]] += slope * projected_area;
}
// std::cout << i << ' ' << n0 << ' ' << n1 << ' ' << n2 << " "
// << projected_area << " " << slope << '\n';
#else
/* The 1D diffusion operation is implemented ad hoc, not using FEM
* formulation (e.g. computing shape function derivation on the edges).
*/
const size_t tsize = ntop-1;
#pragma acc parallel loop
for (std::size_t i=0; i<tsize;i++) {
int n0 = top_nodes[i];
int n1 = top_nodes[i+1];
double dx = std::fabs(coord[n1][0] - coord[n0][0]);
#pragma acc atomic update
total_dx[n0] += dx;
#pragma acc atomic update
total_dx[n1] += dx;
double slope = (coord[n1][1] - coord[n0][1]) / dx;
#pragma acc atomic update
total_slope[n0] -= slope;
#pragma acc atomic update
total_slope[n1] += slope;
// std::cout << i << ' ' << n0 << ' ' << n1 << " " << dx << " " << slope << '\n';
#endif
}
#ifdef THREED
#pragma acc parallel loop
#endif
for (int i=0; i<ntop; ++i) {
// we don't treat edge nodes specially, i.e. reflecting bc is used for erosion.
int n = top_nodes[i];
double conv = surfinfo.surf_diff * var.dt * total_slope[n] / total_dx[n];
#ifdef THREED
dh[i] -= conv;
#else
if ( coord[n][1] > surfinfo.base_level && conv > 0.) {
dh[i] -= surfinfo.diff_ratio_terrig * conv;
} else if ( coord[n][1] <= surfinfo.base_level && conv < 0. ) {
dh[i] -= surfinfo.diff_ratio_marine * conv;
} else {
dh[i] -= conv;
}
#endif
}
#ifdef USE_NPROF
nvtxRangePop();
#endif
}
void custom_surface_processes(const Variables& var, array_t& coord)
{
const int top_bdry = iboundz1;
const int_vec& top_nodes = *var.bnodes[top_bdry];
const std::size_t ntop = top_nodes.size();
// loops over all top nodes
for (std::size_t i=0; i<ntop; ++i) {
int n = top_nodes[i];
// coordinate of this node
double x = coord[n][0];
double z = coord[n][NDIMS-1];
// compute topography changes here ...
// positive dh means sedimentation, negative dh means erosion
double dh = 0;
{
// dh == ....
}
coord[n][NDIMS-1] += dh;
}
}
void get_surface_info(const Variables& var, \
double_vec& top_base, double_vec& top_depth) {
#ifdef USE_NPROF
nvtxRangePushA(__FUNCTION__);
#endif
const array_t& coord = *var.coord;
const SurfaceInfo& surfinfo = var.surfinfo;
const int_vec& top_nodes = *surfinfo.top_nodes;
const std::size_t ntop = top_nodes.size();
for (std::size_t i=0; i<ntop-1;i++) {
int n0 = top_nodes[i];
int n1 = top_nodes[i+1];
double dx = std::fabs(coord[n1][0] - coord[n0][0]);
top_base[i] += dx;
top_base[i+1] += dx;
}
for (std::size_t i=0; i<ntop; i++) {
top_depth[i] = surfinfo.base_level - coord[top_nodes[i]][1];
top_base[i] *= 0.5;
}
#ifdef USE_NPROF
nvtxRangePop();
#endif
}
void out_basin_info(const double_vec& top_depth) {
const int chart_width = 60;
const int ntop = top_depth.size();
const double ratio = double(chart_width) / ntop;
int sum = 0, count_sign = 0;
int_vec signs(chart_width);
for (int i=0;i<ntop;i++) {
double prec = i * ratio;
if(prec > sum) {
int diff = ceil(prec) - sum;
sum += diff;
for (int j=0;j<diff;j++)
if (top_depth[i] > 0.)
signs[count_sign++] = 0;
else
signs[count_sign++] = 1;
}
}
std::cout << "\t";
for (int i=0;i<chart_width;i++)
if (signs[i] == 0)
std::cout << " ";
else
if (i == 0 || i == (chart_width-1))
std::cout << " ";
else if (signs[i+1] == 0)
std::cout << " ";
else if (signs[i-1] == 0)
std::cout << " ";
else
std::cout << "_";
std::cout << std::endl << "\t";
for (int i=0;i<chart_width;i++)
if (signs[i] == 0)
std::cout << "_";
else
if (i == 0 || i == (chart_width-1))
std::cout << "|";
else if (signs[i+1] == 0)
std::cout << "\\";
else if (signs[i-1] == 0)
std::cout << "/";
else
std::cout << " ";
std::cout << " (ntop: " << std::setw(3) << ntop << ")\n";
}