forked from CEED/Laghos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlaghos.cpp
1120 lines (1053 loc) · 41.7 KB
/
laghos.cpp
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
// Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at
// the Lawrence Livermore National Laboratory. LLNL-CODE-734707. All Rights
// reserved. See files LICENSE and NOTICE for details.
//
// This file is part of CEED, a collection of benchmarks, miniapps, software
// libraries and APIs for efficient high-order finite element and spectral
// element discretizations for exascale applications. For more information and
// source code availability see http://github.com/ceed.
//
// The CEED research is supported by the Exascale Computing Project 17-SC-20-SC,
// a collaborative effort of two U.S. Department of Energy organizations (Office
// of Science and the National Nuclear Security Administration) responsible for
// the planning and preparation of a capable exascale ecosystem, including
// software, applications, hardware, advanced system engineering and early
// testbed platforms, in support of the nation's exascale computing imperative.
//
// __ __
// / / ____ ____ / /_ ____ _____
// / / / __ `/ __ `/ __ \/ __ \/ ___/
// / /___/ /_/ / /_/ / / / / /_/ (__ )
// /_____/\__,_/\__, /_/ /_/\____/____/
// /____/
//
// High-order Lagrangian Hydrodynamics Miniapp
//
// Laghos(LAGrangian High-Order Solver) is a miniapp that solves the
// time-dependent Euler equation of compressible gas dynamics in a moving
// Lagrangian frame using unstructured high-order finite element spatial
// discretization and explicit high-order time-stepping. Laghos is based on the
// numerical algorithm described in the following article:
//
// V. Dobrev, Tz. Kolev and R. Rieben, "High-order curvilinear finite element
// methods for Lagrangian hydrodynamics", SIAM Journal on Scientific
// Computing, (34) 2012, pp. B606–B641, https://doi.org/10.1137/120864672.
//
// Test problems:
// p = 0 --> Taylor-Green vortex (smooth problem).
// p = 1 --> Sedov blast.
// p = 2 --> 1D Sod shock tube.
// p = 3 --> Triple point.
// p = 4 --> Gresho vortex (smooth problem).
// p = 5 --> 2D Riemann problem, config. 12 of doi.org/10.1002/num.10025
// p = 6 --> 2D Riemann problem, config. 6 of doi.org/10.1002/num.10025
// p = 7 --> 2D Rayleigh-Taylor instability problem.
//
// Sample runs: see README.md, section 'Verification of Results'.
//
// Combinations resulting in 3D uniform Cartesian MPI partitionings of the mesh:
// -m data/cube01_hex.mesh -pt 211 for 2 / 16 / 128 / 1024 ... tasks.
// -m data/cube_922_hex.mesh -pt 921 for / 18 / 144 / 1152 ... tasks.
// -m data/cube_522_hex.mesh -pt 522 for / 20 / 160 / 1280 ... tasks.
// -m data/cube_12_hex.mesh -pt 311 for 3 / 24 / 192 / 1536 ... tasks.
// -m data/cube01_hex.mesh -pt 221 for 4 / 32 / 256 / 2048 ... tasks.
// -m data/cube_922_hex.mesh -pt 922 for / 36 / 288 / 2304 ... tasks.
// -m data/cube_522_hex.mesh -pt 511 for 5 / 40 / 320 / 2560 ... tasks.
// -m data/cube_12_hex.mesh -pt 321 for 6 / 48 / 384 / 3072 ... tasks.
// -m data/cube01_hex.mesh -pt 111 for 8 / 64 / 512 / 4096 ... tasks.
// -m data/cube_922_hex.mesh -pt 911 for 9 / 72 / 576 / 4608 ... tasks.
// -m data/cube_522_hex.mesh -pt 521 for 10 / 80 / 640 / 5120 ... tasks.
// -m data/cube_12_hex.mesh -pt 322 for 12 / 96 / 768 / 6144 ... tasks.
#include <fstream>
#include <sys/time.h>
#include <sys/resource.h>
#include "laghos_solver.hpp"
using std::cout;
using std::endl;
using namespace mfem;
// Choice for the problem setup.
static int problem, dim;
// Forward declarations.
double e0(const Vector &);
double rho0(const Vector &);
double gamma_func(const Vector &);
void v0(const Vector &, Vector &);
static long GetMaxRssMB();
static void display_banner(std::ostream&);
static void Checks(const int ti, const double norm, int &checks);
int main(int argc, char *argv[])
{
// Initialize MPI.
MPI_Session mpi(argc, argv);
const int myid = mpi.WorldRank();
// Print the banner.
if (mpi.Root()) { display_banner(cout); }
// Parse command-line options.
problem = 1;
dim = 3;
const char *mesh_file = "default";
int rs_levels = 2;
int rp_levels = 0;
Array<int> cxyz;
int order_v = 2;
int order_e = 1;
int order_q = -1;
int ode_solver_type = 4;
double t_final = 0.6;
double cfl = 0.5;
double cg_tol = 1e-8;
double ftz_tol = 0.0;
int cg_max_iter = 300;
int max_tsteps = -1;
bool p_assembly = true;
bool impose_visc = false;
bool visualization = false;
int vis_steps = 5;
bool visit = false;
bool gfprint = false;
const char *basename = "results/Laghos";
int partition_type = 0;
const char *device = "cpu";
bool check = false;
bool mem_usage = false;
bool fom = false;
bool gpu_aware_mpi = false;
int dev = 0;
double blast_energy = 0.25;
double blast_position[] = {0.0, 0.0, 0.0};
OptionsParser args(argc, argv);
args.AddOption(&dim, "-dim", "--dimension", "Dimension of the problem.");
args.AddOption(&mesh_file, "-m", "--mesh", "Mesh file to use.");
args.AddOption(&rs_levels, "-rs", "--refine-serial",
"Number of times to refine the mesh uniformly in serial.");
args.AddOption(&rp_levels, "-rp", "--refine-parallel",
"Number of times to refine the mesh uniformly in parallel.");
args.AddOption(&cxyz, "-c", "--cartesian-partitioning",
"Use Cartesian partitioning.");
args.AddOption(&problem, "-p", "--problem", "Problem setup to use.");
args.AddOption(&order_v, "-ok", "--order-kinematic",
"Order (degree) of the kinematic finite element space.");
args.AddOption(&order_e, "-ot", "--order-thermo",
"Order (degree) of the thermodynamic finite element space.");
args.AddOption(&order_q, "-oq", "--order-intrule",
"Order of the integration rule.");
args.AddOption(&ode_solver_type, "-s", "--ode-solver",
"ODE solver: 1 - Forward Euler,\n\t"
" 2 - RK2 SSP, 3 - RK3 SSP, 4 - RK4, 6 - RK6,\n\t"
" 7 - RK2Avg.");
args.AddOption(&t_final, "-tf", "--t-final",
"Final time; start time is 0.");
args.AddOption(&cfl, "-cfl", "--cfl", "CFL-condition number.");
args.AddOption(&cg_tol, "-cgt", "--cg-tol",
"Relative CG tolerance (velocity linear solve).");
args.AddOption(&ftz_tol, "-ftz", "--ftz-tol",
"Absolute flush-to-zero tolerance.");
args.AddOption(&cg_max_iter, "-cgm", "--cg-max-steps",
"Maximum number of CG iterations (velocity linear solve).");
args.AddOption(&max_tsteps, "-ms", "--max-steps",
"Maximum number of steps (negative means no restriction).");
args.AddOption(&p_assembly, "-pa", "--partial-assembly", "-fa",
"--full-assembly",
"Activate 1D tensor-based assembly (partial assembly).");
args.AddOption(&impose_visc, "-iv", "--impose-viscosity", "-niv",
"--no-impose-viscosity",
"Use active viscosity terms even for smooth problems.");
args.AddOption(&visualization, "-vis", "--visualization", "-no-vis",
"--no-visualization",
"Enable or disable GLVis visualization.");
args.AddOption(&vis_steps, "-vs", "--visualization-steps",
"Visualize every n-th timestep.");
args.AddOption(&visit, "-visit", "--visit", "-no-visit", "--no-visit",
"Enable or disable VisIt visualization.");
args.AddOption(&gfprint, "-print", "--print", "-no-print", "--no-print",
"Enable or disable result output (files in mfem format).");
args.AddOption(&basename, "-k", "--outputfilename",
"Name of the visit dump files");
args.AddOption(&partition_type, "-pt", "--partition",
"Customized x/y/z Cartesian MPI partitioning of the serial mesh.\n\t"
"Here x,y,z are relative task ratios in each direction.\n\t"
"Example: with 48 mpi tasks and -pt 321, one would get a Cartesian\n\t"
"partition of the serial mesh by (6,4,2) MPI tasks in (x,y,z).\n\t"
"NOTE: the serially refined mesh must have the appropriate number\n\t"
"of zones in each direction, e.g., the number of zones in direction x\n\t"
"must be divisible by the number of MPI tasks in direction x.\n\t"
"Available options: 11, 21, 111, 211, 221, 311, 321, 322, 432.");
args.AddOption(&device, "-d", "--device",
"Device configuration string, see Device::Configure().");
args.AddOption(&check, "-chk", "--checks", "-no-chk", "--no-checks",
"Enable 2D checks.");
args.AddOption(&mem_usage, "-mb", "--mem", "-no-mem", "--no-mem",
"Enable memory usage.");
args.AddOption(&fom, "-f", "--fom", "-no-fom", "--no-fom",
"Enable figure of merit output.");
args.AddOption(&gpu_aware_mpi, "-gam", "--gpu-aware-mpi", "-no-gam",
"--no-gpu-aware-mpi", "Enable GPU aware MPI communications.");
args.AddOption(&dev, "-dev", "--dev", "GPU device to use.");
args.Parse();
if (!args.Good())
{
if (mpi.Root()) { args.PrintUsage(cout); }
return 1;
}
if (mpi.Root()) { args.PrintOptions(cout); }
// Configure the device from the command line options
Device backend;
backend.Configure(device, dev);
if (mpi.Root()) { backend.Print(); }
backend.SetGPUAwareMPI(gpu_aware_mpi);
// On all processors, use the default builtin 1D/2D/3D mesh or read the
// serial one given on the command line.
Mesh *mesh;
if (strncmp(mesh_file, "default", 7) != 0)
{
mesh = new Mesh(mesh_file, true, true);
}
else
{
if (dim == 1)
{
mesh = new Mesh(Mesh::MakeCartesian1D(2));
mesh->GetBdrElement(0)->SetAttribute(1);
mesh->GetBdrElement(1)->SetAttribute(1);
}
if (dim == 2)
{
mesh = new Mesh(Mesh::MakeCartesian2D(2, 2, Element::QUADRILATERAL,
true));
const int NBE = mesh->GetNBE();
for (int b = 0; b < NBE; b++)
{
Element *bel = mesh->GetBdrElement(b);
const int attr = (b < NBE/2) ? 2 : 1;
bel->SetAttribute(attr);
}
}
if (dim == 3)
{
mesh = new Mesh(Mesh::MakeCartesian3D(2, 2, 2, Element::HEXAHEDRON,
true));
const int NBE = mesh->GetNBE();
for (int b = 0; b < NBE; b++)
{
Element *bel = mesh->GetBdrElement(b);
const int attr = (b < NBE/3) ? 3 : (b < 2*NBE/3) ? 1 : 2;
bel->SetAttribute(attr);
}
}
}
dim = mesh->Dimension();
// 1D vs partial assembly sanity check.
if (p_assembly && dim == 1)
{
p_assembly = false;
if (mpi.Root())
{
cout << "Laghos does not support PA in 1D. Switching to FA." << endl;
}
}
// Refine the mesh in serial to increase the resolution.
for (int lev = 0; lev < rs_levels; lev++) { mesh->UniformRefinement(); }
const int mesh_NE = mesh->GetNE();
if (mpi.Root())
{
cout << "Number of zones in the serial mesh: " << mesh_NE << endl;
}
// Parallel partitioning of the mesh.
ParMesh *pmesh = nullptr;
const int num_tasks = mpi.WorldSize(); int unit = 1;
int *nxyz = new int[dim];
switch (partition_type)
{
case 0:
for (int d = 0; d < dim; d++) { nxyz[d] = unit; }
break;
case 11:
case 111:
unit = static_cast<int>(floor(pow(num_tasks, 1.0 / dim) + 1e-2));
for (int d = 0; d < dim; d++) { nxyz[d] = unit; }
break;
case 21: // 2D
unit = static_cast<int>(floor(pow(num_tasks / 2, 1.0 / 2) + 1e-2));
nxyz[0] = 2 * unit; nxyz[1] = unit;
break;
case 31: // 2D
unit = static_cast<int>(floor(pow(num_tasks / 3, 1.0 / 2) + 1e-2));
nxyz[0] = 3 * unit; nxyz[1] = unit;
break;
case 32: // 2D
unit = static_cast<int>(floor(pow(2 * num_tasks / 3, 1.0 / 2) + 1e-2));
nxyz[0] = 3 * unit / 2; nxyz[1] = unit;
break;
case 49: // 2D
unit = static_cast<int>(floor(pow(9 * num_tasks / 4, 1.0 / 2) + 1e-2));
nxyz[0] = 4 * unit / 9; nxyz[1] = unit;
break;
case 51: // 2D
unit = static_cast<int>(floor(pow(num_tasks / 5, 1.0 / 2) + 1e-2));
nxyz[0] = 5 * unit; nxyz[1] = unit;
break;
case 211: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 2, 1.0 / 3) + 1e-2));
nxyz[0] = 2 * unit; nxyz[1] = unit; nxyz[2] = unit;
break;
case 221: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 4, 1.0 / 3) + 1e-2));
nxyz[0] = 2 * unit; nxyz[1] = 2 * unit; nxyz[2] = unit;
break;
case 311: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 3, 1.0 / 3) + 1e-2));
nxyz[0] = 3 * unit; nxyz[1] = unit; nxyz[2] = unit;
break;
case 321: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 6, 1.0 / 3) + 1e-2));
nxyz[0] = 3 * unit; nxyz[1] = 2 * unit; nxyz[2] = unit;
break;
case 322: // 3D.
unit = static_cast<int>(floor(pow(2 * num_tasks / 3, 1.0 / 3) + 1e-2));
nxyz[0] = 3 * unit / 2; nxyz[1] = unit; nxyz[2] = unit;
break;
case 432: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 3, 1.0 / 3) + 1e-2));
nxyz[0] = 2 * unit; nxyz[1] = 3 * unit / 2; nxyz[2] = unit;
break;
case 511: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 5, 1.0 / 3) + 1e-2));
nxyz[0] = 5 * unit; nxyz[1] = unit; nxyz[2] = unit;
break;
case 521: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 10, 1.0 / 3) + 1e-2));
nxyz[0] = 5 * unit; nxyz[1] = 2 * unit; nxyz[2] = unit;
break;
case 522: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 20, 1.0 / 3) + 1e-2));
nxyz[0] = 5 * unit; nxyz[1] = 2 * unit; nxyz[2] = 2 * unit;
break;
case 911: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 9, 1.0 / 3) + 1e-2));
nxyz[0] = 9 * unit; nxyz[1] = unit; nxyz[2] = unit;
break;
case 921: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 18, 1.0 / 3) + 1e-2));
nxyz[0] = 9 * unit; nxyz[1] = 2 * unit; nxyz[2] = unit;
break;
case 922: // 3D.
unit = static_cast<int>(floor(pow(num_tasks / 36, 1.0 / 3) + 1e-2));
nxyz[0] = 9 * unit; nxyz[1] = 2 * unit; nxyz[2] = 2 * unit;
break;
default:
if (myid == 0)
{
cout << "Unknown partition type: " << partition_type << '\n';
}
delete mesh;
MPI_Finalize();
return 3;
}
int product = 1;
for (int d = 0; d < dim; d++) { product *= nxyz[d]; }
const bool cartesian_partitioning = (cxyz.Size()>0)?true:false;
if (product == num_tasks || cartesian_partitioning)
{
if (cartesian_partitioning)
{
int cproduct = 1;
for (int d = 0; d < dim; d++) { cproduct *= cxyz[d]; }
MFEM_VERIFY(!cartesian_partitioning || cxyz.Size() == dim,
"Expected " << mesh->SpaceDimension() << " integers with the "
"option --cartesian-partitioning.");
MFEM_VERIFY(!cartesian_partitioning || num_tasks == cproduct,
"Expected cartesian partitioning product to match number of ranks.");
}
int *partitioning = cartesian_partitioning ?
mesh->CartesianPartitioning(cxyz):
mesh->CartesianPartitioning(nxyz);
pmesh = new ParMesh(MPI_COMM_WORLD, *mesh, partitioning);
delete [] partitioning;
}
else
{
if (myid == 0)
{
cout << "Non-Cartesian partitioning through METIS will be used.\n";
#ifndef MFEM_USE_METIS
cout << "MFEM was built without METIS. "
<< "Adjust the number of tasks to use a Cartesian split." << endl;
#endif
}
#ifndef MFEM_USE_METIS
return 1;
#endif
pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);
}
delete [] nxyz;
delete mesh;
// Refine the mesh further in parallel to increase the resolution.
for (int lev = 0; lev < rp_levels; lev++) { pmesh->UniformRefinement(); }
int NE = pmesh->GetNE(), ne_min, ne_max;
MPI_Reduce(&NE, &ne_min, 1, MPI_INT, MPI_MIN, 0, pmesh->GetComm());
MPI_Reduce(&NE, &ne_max, 1, MPI_INT, MPI_MAX, 0, pmesh->GetComm());
if (myid == 0)
{ cout << "Zones min/max: " << ne_min << " " << ne_max << endl; }
// Define the parallel finite element spaces. We use:
// - H1 (Gauss-Lobatto, continuous) for position and velocity.
// - L2 (Bernstein, discontinuous) for specific internal energy.
L2_FECollection L2FEC(order_e, dim, BasisType::Positive);
H1_FECollection H1FEC(order_v, dim);
ParFiniteElementSpace L2FESpace(pmesh, &L2FEC);
ParFiniteElementSpace H1FESpace(pmesh, &H1FEC, pmesh->Dimension());
// Boundary conditions: all tests use v.n = 0 on the boundary, and we assume
// that the boundaries are straight.
Array<int> ess_tdofs, ess_vdofs;
{
Array<int> ess_bdr(pmesh->bdr_attributes.Max()), dofs_marker, dofs_list;
for (int d = 0; d < pmesh->Dimension(); d++)
{
// Attributes 1/2/3 correspond to fixed-x/y/z boundaries,
// i.e., we must enforce v_x/y/z = 0 for the velocity components.
ess_bdr = 0; ess_bdr[d] = 1;
H1FESpace.GetEssentialTrueDofs(ess_bdr, dofs_list, d);
ess_tdofs.Append(dofs_list);
H1FESpace.GetEssentialVDofs(ess_bdr, dofs_marker, d);
FiniteElementSpace::MarkerToList(dofs_marker, dofs_list);
ess_vdofs.Append(dofs_list);
}
}
// Define the explicit ODE solver used for time integration.
ODESolver *ode_solver = NULL;
switch (ode_solver_type)
{
case 1: ode_solver = new ForwardEulerSolver; break;
case 2: ode_solver = new RK2Solver(0.5); break;
case 3: ode_solver = new RK3SSPSolver; break;
case 4: ode_solver = new RK4Solver; break;
case 6: ode_solver = new RK6Solver; break;
case 7: ode_solver = new RK2AvgSolver; break;
default:
if (myid == 0)
{
cout << "Unknown ODE solver type: " << ode_solver_type << '\n';
}
delete pmesh;
MPI_Finalize();
return 3;
}
const HYPRE_Int glob_size_l2 = L2FESpace.GlobalTrueVSize();
const HYPRE_Int glob_size_h1 = H1FESpace.GlobalTrueVSize();
if (mpi.Root())
{
cout << "Number of kinematic (position, velocity) dofs: "
<< glob_size_h1 << endl;
cout << "Number of specific internal energy dofs: "
<< glob_size_l2 << endl;
}
// The monolithic BlockVector stores unknown fields as:
// - 0 -> position
// - 1 -> velocity
// - 2 -> specific internal energy
const int Vsize_l2 = L2FESpace.GetVSize();
const int Vsize_h1 = H1FESpace.GetVSize();
Array<int> offset(4);
offset[0] = 0;
offset[1] = offset[0] + Vsize_h1;
offset[2] = offset[1] + Vsize_h1;
offset[3] = offset[2] + Vsize_l2;
BlockVector S(offset, Device::GetMemoryType());
// Define GridFunction objects for the position, velocity and specific
// internal energy. There is no function for the density, as we can always
// compute the density values given the current mesh position, using the
// property of pointwise mass conservation.
ParGridFunction x_gf, v_gf, e_gf;
x_gf.MakeRef(&H1FESpace, S, offset[0]);
v_gf.MakeRef(&H1FESpace, S, offset[1]);
e_gf.MakeRef(&L2FESpace, S, offset[2]);
// Initialize x_gf using the starting mesh coordinates.
pmesh->SetNodalGridFunction(&x_gf);
// Sync the data location of x_gf with its base, S
x_gf.SyncAliasMemory(S);
// Initialize the velocity.
VectorFunctionCoefficient v_coeff(pmesh->Dimension(), v0);
v_gf.ProjectCoefficient(v_coeff);
for (int i = 0; i < ess_vdofs.Size(); i++)
{
v_gf(ess_vdofs[i]) = 0.0;
}
// Sync the data location of v_gf with its base, S
v_gf.SyncAliasMemory(S);
// Initialize density and specific internal energy values. We interpolate in
// a non-positive basis to get the correct values at the dofs. Then we do an
// L2 projection to the positive basis in which we actually compute. The goal
// is to get a high-order representation of the initial condition. Note that
// this density is a temporary function and it will not be updated during the
// time evolution.
ParGridFunction rho0_gf(&L2FESpace);
FunctionCoefficient rho0_coeff(rho0);
L2_FECollection l2_fec(order_e, pmesh->Dimension());
ParFiniteElementSpace l2_fes(pmesh, &l2_fec);
ParGridFunction l2_rho0_gf(&l2_fes), l2_e(&l2_fes);
l2_rho0_gf.ProjectCoefficient(rho0_coeff);
rho0_gf.ProjectGridFunction(l2_rho0_gf);
if (problem == 1)
{
// For the Sedov test, we use a delta function at the origin.
DeltaCoefficient e_coeff(blast_position[0], blast_position[1],
blast_position[2], blast_energy);
l2_e.ProjectCoefficient(e_coeff);
}
else
{
FunctionCoefficient e_coeff(e0);
l2_e.ProjectCoefficient(e_coeff);
}
e_gf.ProjectGridFunction(l2_e);
// Sync the data location of e_gf with its base, S
e_gf.SyncAliasMemory(S);
// Piecewise constant ideal gas coefficient over the Lagrangian mesh. The
// gamma values are projected on function that's constant on the moving mesh.
L2_FECollection mat_fec(0, pmesh->Dimension());
ParFiniteElementSpace mat_fes(pmesh, &mat_fec);
ParGridFunction mat_gf(&mat_fes);
FunctionCoefficient mat_coeff(gamma_func);
mat_gf.ProjectCoefficient(mat_coeff);
// Additional details, depending on the problem.
int source = 0; bool visc = true, vorticity = false;
switch (problem)
{
case 0: if (pmesh->Dimension() == 2) { source = 1; } visc = false; break;
case 1: visc = true; break;
case 2: visc = true; break;
case 3: visc = true; S.HostRead(); break;
case 4: visc = false; break;
case 5: visc = true; break;
case 6: visc = true; break;
case 7: source = 2; visc = true; vorticity = true; break;
default: MFEM_ABORT("Wrong problem specification!");
}
if (impose_visc) { visc = true; }
hydrodynamics::LagrangianHydroOperator hydro(S.Size(),
H1FESpace, L2FESpace, ess_tdofs,
rho0_coeff, rho0_gf,
mat_gf, source, cfl,
visc, vorticity, p_assembly,
cg_tol, cg_max_iter, ftz_tol,
order_q);
socketstream vis_rho, vis_v, vis_e;
char vishost[] = "localhost";
int visport = 19916;
ParGridFunction rho_gf;
if (visualization || visit) { hydro.ComputeDensity(rho_gf); }
const double energy_init = hydro.InternalEnergy(e_gf) +
hydro.KineticEnergy(v_gf);
if (visualization)
{
// Make sure all MPI ranks have sent their 'v' solution before initiating
// another set of GLVis connections (one from each rank):
MPI_Barrier(pmesh->GetComm());
vis_rho.precision(8);
vis_v.precision(8);
vis_e.precision(8);
int Wx = 0, Wy = 0; // window position
const int Ww = 350, Wh = 350; // window size
int offx = Ww+10; // window offsets
if (problem != 0 && problem != 4)
{
hydrodynamics::VisualizeField(vis_rho, vishost, visport, rho_gf,
"Density", Wx, Wy, Ww, Wh);
}
Wx += offx;
hydrodynamics::VisualizeField(vis_v, vishost, visport, v_gf,
"Velocity", Wx, Wy, Ww, Wh);
Wx += offx;
hydrodynamics::VisualizeField(vis_e, vishost, visport, e_gf,
"Specific Internal Energy", Wx, Wy, Ww, Wh);
}
// Save data for VisIt visualization.
VisItDataCollection visit_dc(basename, pmesh);
if (visit)
{
visit_dc.RegisterField("Density", &rho_gf);
visit_dc.RegisterField("Velocity", &v_gf);
visit_dc.RegisterField("Specific Internal Energy", &e_gf);
visit_dc.SetCycle(0);
visit_dc.SetTime(0.0);
visit_dc.Save();
}
// Perform time-integration (looping over the time iterations, ti, with a
// time-step dt). The object oper is of type LagrangianHydroOperator that
// defines the Mult() method that used by the time integrators.
ode_solver->Init(hydro);
hydro.ResetTimeStepEstimate();
double t = 0.0, dt = hydro.GetTimeStepEstimate(S), t_old;
bool last_step = false;
int steps = 0;
BlockVector S_old(S);
long mem=0, mmax=0, msum=0;
int checks = 0;
// const double internal_energy = hydro.InternalEnergy(e_gf);
// const double kinetic_energy = hydro.KineticEnergy(v_gf);
// if (mpi.Root())
// {
// cout << std::fixed;
// cout << "step " << std::setw(5) << 0
// << ",\tt = " << std::setw(5) << std::setprecision(4) << t
// << ",\tdt = " << std::setw(5) << std::setprecision(6) << dt
// << ",\t|IE| = " << std::setprecision(10) << std::scientific
// << internal_energy
// << ",\t|KE| = " << std::setprecision(10) << std::scientific
// << kinetic_energy
// << ",\t|E| = " << std::setprecision(10) << std::scientific
// << kinetic_energy+internal_energy;
// cout << std::fixed;
// if (mem_usage)
// {
// cout << ", mem: " << mmax << "/" << msum << " MB";
// }
// cout << endl;
// }
for (int ti = 1; !last_step; ti++)
{
if (t + dt >= t_final)
{
dt = t_final - t;
last_step = true;
}
if (steps == max_tsteps) { last_step = true; }
S_old = S;
t_old = t;
hydro.ResetTimeStepEstimate();
// S is the vector of dofs, t is the current time, and dt is the time step
// to advance.
ode_solver->Step(S, t, dt);
steps++;
// Adaptive time step control.
const double dt_est = hydro.GetTimeStepEstimate(S);
if (dt_est < dt)
{
// Repeat (solve again) with a decreased time step - decrease of the
// time estimate suggests appearance of oscillations.
dt *= 0.85;
if (dt < std::numeric_limits<double>::epsilon())
{ MFEM_ABORT("The time step crashed!"); }
t = t_old;
S = S_old;
hydro.ResetQuadratureData();
if (mpi.Root()) { cout << "Repeating step " << ti << endl; }
if (steps < max_tsteps) { last_step = false; }
ti--; continue;
}
else if (dt_est > 1.25 * dt) { dt *= 1.02; }
// Ensure the sub-vectors x_gf, v_gf, and e_gf know the location of the
// data in S. This operation simply updates the Memory validity flags of
// the sub-vectors to match those of S.
x_gf.SyncAliasMemory(S);
v_gf.SyncAliasMemory(S);
e_gf.SyncAliasMemory(S);
// Make sure that the mesh corresponds to the new solution state. This is
// needed, because some time integrators use different S-type vectors
// and the oper object might have redirected the mesh positions to those.
pmesh->NewNodes(x_gf, false);
if (last_step || (ti % vis_steps) == 0)
{
double lnorm = e_gf * e_gf, norm;
MPI_Allreduce(&lnorm, &norm, 1, MPI_DOUBLE, MPI_SUM, pmesh->GetComm());
if (mem_usage)
{
mem = GetMaxRssMB();
MPI_Reduce(&mem, &mmax, 1, MPI_LONG, MPI_MAX, 0, pmesh->GetComm());
MPI_Reduce(&mem, &msum, 1, MPI_LONG, MPI_SUM, 0, pmesh->GetComm());
}
// const double internal_energy = hydro.InternalEnergy(e_gf);
// const double kinetic_energy = hydro.KineticEnergy(v_gf);
if (mpi.Root())
{
const double sqrt_norm = sqrt(norm);
cout << std::fixed;
cout << "step " << std::setw(5) << ti
<< ",\tt = " << std::setw(5) << std::setprecision(4) << t
<< ",\tdt = " << std::setw(5) << std::setprecision(6) << dt
<< ",\t|e| = " << std::setprecision(10) << std::scientific
<< sqrt_norm;
// << ",\t|IE| = " << std::setprecision(10) << std::scientific
// << internal_energy
// << ",\t|KE| = " << std::setprecision(10) << std::scientific
// << kinetic_energy
// << ",\t|E| = " << std::setprecision(10) << std::scientific
// << kinetic_energy+internal_energy;
cout << std::fixed;
if (mem_usage)
{
cout << ", mem: " << mmax << "/" << msum << " MB";
}
cout << endl;
}
// Make sure all ranks have sent their 'v' solution before initiating
// another set of GLVis connections (one from each rank):
MPI_Barrier(pmesh->GetComm());
if (visualization || visit || gfprint) { hydro.ComputeDensity(rho_gf); }
if (visualization)
{
int Wx = 0, Wy = 0; // window position
int Ww = 350, Wh = 350; // window size
int offx = Ww+10; // window offsets
if (problem != 0 && problem != 4)
{
hydrodynamics::VisualizeField(vis_rho, vishost, visport, rho_gf,
"Density", Wx, Wy, Ww, Wh);
}
Wx += offx;
hydrodynamics::VisualizeField(vis_v, vishost, visport,
v_gf, "Velocity", Wx, Wy, Ww, Wh);
Wx += offx;
hydrodynamics::VisualizeField(vis_e, vishost, visport, e_gf,
"Specific Internal Energy",
Wx, Wy, Ww,Wh);
Wx += offx;
}
if (visit)
{
visit_dc.SetCycle(ti);
visit_dc.SetTime(t);
visit_dc.Save();
}
if (gfprint)
{
std::ostringstream mesh_name, rho_name, v_name, e_name;
mesh_name << basename << "_" << ti << "_mesh";
rho_name << basename << "_" << ti << "_rho";
v_name << basename << "_" << ti << "_v";
e_name << basename << "_" << ti << "_e";
std::ofstream mesh_ofs(mesh_name.str().c_str());
mesh_ofs.precision(8);
pmesh->PrintAsOne(mesh_ofs);
mesh_ofs.close();
std::ofstream rho_ofs(rho_name.str().c_str());
rho_ofs.precision(8);
rho_gf.SaveAsOne(rho_ofs);
rho_ofs.close();
std::ofstream v_ofs(v_name.str().c_str());
v_ofs.precision(8);
v_gf.SaveAsOne(v_ofs);
v_ofs.close();
std::ofstream e_ofs(e_name.str().c_str());
e_ofs.precision(8);
e_gf.SaveAsOne(e_ofs);
e_ofs.close();
}
}
// Problems checks
if (check)
{
double lnorm = e_gf * e_gf, norm;
MPI_Allreduce(&lnorm, &norm, 1, MPI_DOUBLE, MPI_SUM, pmesh->GetComm());
const double e_norm = sqrt(norm);
MFEM_VERIFY(rs_levels==0 && rp_levels==0, "check: rs, rp");
MFEM_VERIFY(order_v==2, "check: order_v");
MFEM_VERIFY(order_e==1, "check: order_e");
MFEM_VERIFY(ode_solver_type==4, "check: ode_solver_type");
MFEM_VERIFY(t_final == 0.6, "check: t_final");
MFEM_VERIFY(cfl==0.5, "check: cfl");
MFEM_VERIFY(strncmp(mesh_file, "default", 7) == 0, "check: mesh_file");
MFEM_VERIFY(dim==2 || dim==3, "check: dimension");
Checks(ti, e_norm, checks);
}
}
MFEM_VERIFY(!check || checks == 2, "Check error!");
switch (ode_solver_type)
{
case 2: steps *= 2; break;
case 3: steps *= 3; break;
case 4: steps *= 4; break;
case 6: steps *= 6; break;
case 7: steps *= 2;
}
hydro.PrintTimingData(mpi.Root(), steps, fom);
if (mem_usage)
{
mem = GetMaxRssMB();
MPI_Reduce(&mem, &mmax, 1, MPI_LONG, MPI_MAX, 0, pmesh->GetComm());
MPI_Reduce(&mem, &msum, 1, MPI_LONG, MPI_SUM, 0, pmesh->GetComm());
}
const double energy_final = hydro.InternalEnergy(e_gf) +
hydro.KineticEnergy(v_gf);
if (mpi.Root())
{
cout << endl;
cout << "Energy diff: " << std::scientific << std::setprecision(2)
<< fabs(energy_init - energy_final) << endl;
if (mem_usage)
{
cout << "Maximum memory resident set size: "
<< mmax << "/" << msum << " MB" << endl;
}
}
// Print the error.
// For problems 0 and 4 the exact velocity is constant in time.
if (problem == 0 || problem == 4)
{
const double error_max = v_gf.ComputeMaxError(v_coeff),
error_l1 = v_gf.ComputeL1Error(v_coeff),
error_l2 = v_gf.ComputeL2Error(v_coeff);
if (mpi.Root())
{
cout << "L_inf error: " << error_max << endl
<< "L_1 error: " << error_l1 << endl
<< "L_2 error: " << error_l2 << endl;
}
}
if (visualization)
{
vis_v.close();
vis_e.close();
}
// Free the used memory.
delete ode_solver;
delete pmesh;
return 0;
}
double rho0(const Vector &x)
{
switch (problem)
{
case 0: return 1.0;
case 1: return 1.0;
case 2: return (x(0) < 0.5) ? 1.0 : 0.1;
case 3: return (dim == 2) ? (x(0) > 1.0 && x(1) > 1.5) ? 0.125 : 1.0
: x(0) > 1.0 && ((x(1) < 1.5 && x(2) < 1.5) ||
(x(1) > 1.5 && x(2) > 1.5)) ? 0.125 : 1.0;
case 4: return 1.0;
case 5:
{
if (x(0) >= 0.5 && x(1) >= 0.5) { return 0.5313; }
if (x(0) < 0.5 && x(1) < 0.5) { return 0.8; }
return 1.0;
}
case 6:
{
if (x(0) < 0.5 && x(1) >= 0.5) { return 2.0; }
if (x(0) >= 0.5 && x(1) < 0.5) { return 3.0; }
return 1.0;
}
case 7: return x(1) >= 0.0 ? 2.0 : 1.0;
default: MFEM_ABORT("Bad number given for problem id!"); return 0.0;
}
}
double gamma_func(const Vector &x)
{
switch (problem)
{
case 0: return 5.0 / 3.0;
case 1: return 1.4;
case 2: return 1.4;
case 3:
if (dim == 1) { return (x(0) > 0.5) ? 1.4 : 1.5; }
else { return (x(0) > 1.0 && x(1) <= 1.5) ? 1.4 : 1.5; }
case 4: return 5.0 / 3.0;
case 5: return 1.4;
case 6: return 1.4;
case 7: return 5.0 / 3.0;
default: MFEM_ABORT("Bad number given for problem id!"); return 0.0;
}
}
static double rad(double x, double y) { return sqrt(x*x + y*y); }
void v0(const Vector &x, Vector &v)
{
const double atn = dim!=1 ? pow((x(0)*(1.0-x(0))*4*x(1)*(1.0-x(1))*4.0),
0.4) : 0.0;
switch (problem)
{
case 0:
v(0) = sin(M_PI*x(0)) * cos(M_PI*x(1));
v(1) = -cos(M_PI*x(0)) * sin(M_PI*x(1));
if (x.Size() == 3)
{
v(0) *= cos(M_PI*x(2));
v(1) *= cos(M_PI*x(2));
v(2) = 0.0;
}
break;
case 1: v = 0.0; break;
case 2: v = 0.0; break;
case 3: v = 0.0; break;
case 4:
{
v = 0.0;
const double r = rad(x(0), x(1));
if (r < 0.2)
{
v(0) = 5.0 * x(1);
v(1) = -5.0 * x(0);
}
else if (r < 0.4)
{
v(0) = 2.0 * x(1) / r - 5.0 * x(1);
v(1) = -2.0 * x(0) / r + 5.0 * x(0);
}
else { }
break;
}
case 5:
{
v = 0.0;
if (x(0) >= 0.5 && x(1) >= 0.5) { v(0)=0.0*atn, v(1)=0.0*atn; return;}
if (x(0) < 0.5 && x(1) >= 0.5) { v(0)=0.7276*atn, v(1)=0.0*atn; return;}
if (x(0) < 0.5 && x(1) < 0.5) { v(0)=0.0*atn, v(1)=0.0*atn; return;}
if (x(0) >= 0.5 && x(1) < 0.5) { v(0)=0.0*atn, v(1)=0.7276*atn; return; }
MFEM_ABORT("Error in problem 5!");
return;
}
case 6:
{
v = 0.0;
if (x(0) >= 0.5 && x(1) >= 0.5) { v(0)=+0.75*atn, v(1)=-0.5*atn; return;}
if (x(0) < 0.5 && x(1) >= 0.5) { v(0)=+0.75*atn, v(1)=+0.5*atn; return;}
if (x(0) < 0.5 && x(1) < 0.5) { v(0)=-0.75*atn, v(1)=+0.5*atn; return;}
if (x(0) >= 0.5 && x(1) < 0.5) { v(0)=-0.75*atn, v(1)=-0.5*atn; return;}
MFEM_ABORT("Error in problem 6!");
return;
}
case 7:
{
v = 0.0;
v(1) = 0.02 * exp(-2*M_PI*x(1)*x(1)) * cos(2*M_PI*x(0));
break;
}
default: MFEM_ABORT("Bad number given for problem id!");
}
}
double e0(const Vector &x)
{
switch (problem)
{
case 0:
{
const double denom = 2.0 / 3.0; // (5/3 - 1) * density.
double val;
if (x.Size() == 2)
{
val = 1.0 + (cos(2*M_PI*x(0)) + cos(2*M_PI*x(1))) / 4.0;
}
else
{
val = 100.0 + ((cos(2*M_PI*x(2)) + 2) *
(cos(2*M_PI*x(0)) + cos(2*M_PI*x(1))) - 2) / 16.0;
}
return val/denom;
}
case 1: return 0.0; // This case in initialized in main().
case 2: return (x(0) < 0.5) ? 1.0 / rho0(x) / (gamma_func(x) - 1.0)
: 0.1 / rho0(x) / (gamma_func(x) - 1.0);
case 3: return (x(0) > 1.0) ? 0.1 / rho0(x) / (gamma_func(x) - 1.0)
: 1.0 / rho0(x) / (gamma_func(x) - 1.0);