forked from eschnett/Fun1d.jl
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathold_code.jl
More file actions
3044 lines (2397 loc) · 112 KB
/
Copy pathold_code.jl
File metadata and controls
3044 lines (2397 loc) · 112 KB
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
# enforce axis regularity strongly
if (y==1 || y==ns[2]) && false
ψv = Uwxy.ψ
g = Uwxy.g
dx = Uwxy.dr
dy = Uwxy.dθ
P = Uwxy.P
ψ,ψx,ψy,Ψ = ψv
# Calculate inverse metric components
gi = inv(g)
# Calculate lapse and shift
α = 1/sqrt(-gi[1,1])
βx = -gi[1,2]/gi[1,1]
βy = -gi[1,3]/gi[1,1]
# Time derivatives of the metric
∂tg = βx*dx + βy*dy - α*P
∂tψ = βx*ψx + βy*ψy - α*Ψ
# f = (exp(4*ψ)+g[2,2])/exp(2*ψ)/2
# ∂zf = (2*(exp(4*ψ)-g[2,2])*ψy + dy[2,2] )/exp(2*ψ)/2
# ∂tf = (2*(exp(4*ψ)-g[2,2])*∂tψ + ∂tg[2,2])/exp(2*ψ)/2
# gρρ = f^2
# ∂ρgρρ = 0.
# ∂zgρρ = 2*f*∂zf
# ∂tgρρ = 2*f*∂tf
# # gρρ = exp(4*ψ)
# # ∂ρgρρ = 0.
# # ∂zgρρ = 4*gρρ*ψy
# # ∂tgρρ = 4*gρρ*∂tψ
# ψ = log(f)/2
# ψx = 0.
# ψy = ∂zf/f/2
# ∂tψ = ∂tf/f/2
g = StateTensor{Type}((g[1,1],0.,g[1,3],0.,0.,g[3,3]))
dx = StateTensor{Type}((0.,dx[1,2],0.,0.,dx[2,3],0.))
dy = StateTensor{Type}((dy[1,1],0.,dy[1,3],0.,0.,dy[3,3]))
∂tg = StateTensor{Type}((∂tg[1,1],0.,∂tg[1,3],0.,0.,∂tg[3,3]))
Ψ = -(∂tψ - βy*ψy)/α
P = -(∂tg - βy*dy)/α
ψv = (ψ,0.,ψy,Ψ)
Uwxy = StateVector{Type}(0.,ψv,g,dx,dy,P)
Uw[x,y] = Uwxy
else
end
ρ = U[x,y].ρ
# ψv = U.ψ
# g = U.g
# dr = U.dr
# dθ = U.dθ
# P = U.P
# ψ,ψr,ψθ,Ψ = ψv.data
# ∂ψ = @Vec [∂ψ,∂ψr,∂ψθ,∂Ψ]
# A = StateVector{T}((∂ψ,∂g,∂dr,∂dθ,∂P))
nx,ny = ns
ϵ = 2.
if x in 2:nx-1 && y in 2:ny-1
Ud = (ϵ/4)*(U[x-1,y] + U[x+1,y] - 4*U[x,y] + U[x,y-1] + U[x,y+1])
elseif x==1 && y ≠ 1 && y ≠ ny
Ud = (ϵ/4)*(2*U[2,y] - 4*U[1,y] + U[1,y-1] + U[1,y+1])
elseif x==nx && y ≠ 1 && y ≠ ny
Ud = (ϵ/4)*(2*U[nx-1,y] - 4*U[nx,y] + U[nx,y-1] + U[nx,y+1])
elseif y == 1 && x ≠ nx && x ≠ 1
Ud = (ϵ/4)*(U[x-1,1] + U[x+1,1] - 4*U[x,1] + StateVectorParity*U[x,2] + U[x,2])
elseif y == ny && x ≠ nx && x ≠ 1
Ud = (ϵ/4)*(U[x-1,ny] + U[x+1,ny] - 4*U[x,ny] + StateVectorParity*U[x,ny-1] + U[x,ny-1])
elseif x==1 && y==1
Ud = (ϵ/4)*(2*U[2,1] - 4*U[1,1] + StateVectorParity*U[1,2] + U[1,2])
elseif x==nx && y==1
Ud = (ϵ/4)*(2*U[nx-1,1] - 4*U[nx,1] + StateVectorParity*U[nx,2] + U[nx,2])
elseif x==1 && y==ny
Ud = (ϵ/4)*(2*U[2,ny] - 4*U[1,ny] + StateVectorParity*U[1,ny-1] + U[1,ny-1])
elseif x==nx && y==ny
Ud = (ϵ/4)*(2*U[nx-1,ny] - 4*U[nx,ny] + StateVectorParity*U[nx,ny-1] + U[nx,ny-1])
else
Ud = zero(StateVector{Data.Number},ρ)
end
return StateVector{Data.Number}(ρ,Ud.ψ,Ud.g,Ud.dr,Ud.dθ,Ud.P)
# nx,ny = ns
# if x in 2:nx-1 && y in 2:ny-1
# 0.25*(f(U,x,y-1) + f(U,x,y+1) + f(U,x-1,y) + f(U,x+1,y))
# elseif x==1 && y in 2:ny-1
# 0.25*(f(U,x,y-1) + f(U,x,y+1)) + 0.5*f(U,x+1,y)
# elseif x==nx && y in 2:ny-1
# 0.25*(f(U,x,y-1) + f(U,x,y+1)) + 0.5*f(U,x-1,y)
# elseif x in 2:nx-1 && y == 1
# 0.5*f(U,x,y+1) + 0.25*(f(U,x-1,y+1) + f(U,x+1,y+1))
# elseif x in 2:nx-1 && y == ny
# 0.5*f(U,x,y-1) + 0.25*(f(U,x-1,y-1) + f(U,x+1,y-1))
# elseif x==1 && y==1
# 0.5*(f(U,x,y+1) + f(U,x+1,y+1))
# elseif x==nx && y==1
# 0.5*(f(U,x,y+1) + f(U,x-1,y+1))
# elseif x==1 && y==ny
# 0.5*(f(U,x,y-1) + f(U,x+1,y-1))
# elseif x==nx && y==ny
# 0.5*(f(U,x,y-1) + f(U,x-1,y-1))
# end
# @assert false
# end
# ∂tα = -0.5*α*(@einsum n[μ]*n[ν]*∂tg[μ,ν])
# ∂tβ = α*(@einsum γi[α,μ]*n[ν]*∂tg[μ,ν]) # result is a 3-vector
# ∂t∂tg = (βr*∂tdr + βθ*∂tdθ - α*∂tP) + (∂tβ[2]*dr + ∂tβ[3]*dθ - ∂tα*P)
# ∂t∂g = Symmetric3rdOrderTensor{Type}((σ,μ,ν) -> (σ==1 ? ∂t∂tg[μ,ν] : σ==2 ? ∂tdr[μ,ν] : σ==3 ? ∂tdθ[μ,ν] : @assert false))
# ∂tΓ = Symmetric3rdOrderTensor{Type}((σ,μ,ν) -> 0.5*(∂t∂g[ν,μ,σ] + ∂t∂g[μ,ν,σ] - ∂t∂g[σ,μ,ν]))
# ∂tH = Vec{3}((∂Hxy[1,:]...))
# ∂rH = Vec{3}((∂Hxy[2,:]...))
# ∂θH = Vec{3}((∂Hxy[3,:]...))
# ∂tC = (@einsum gi[ϵ,σ]*∂tΓ[λ,ϵ,σ]) - (@einsum gi[μ,ϵ]*gi[ν,σ]*Γ[λ,μ,ν]*∂tg[ϵ,σ]) - ∂tH
# # set up finite differencing for the constraints, by defining a function
# # that calculates the constraints for any x and y index. This
# # might not be the best idea, but should work.
# ∂rC = DρC(constraints,U,r,θ,ns,_ds,x,y)*_ds[1] - ∂rH # + 0.5*γ2*(@einsum (n_[σ]*gi[μ,ν]*Cr[μ,ν] - n[ν]*Cr[σ,ν]))
# ∂θC = DzC(constraints,U,r,θ,ns,_ds,x,y)*_ds[2] - ∂θH # + 0.5*γ2*(@einsum (n_[σ]*gi[μ,ν]*Cθ[μ,ν] - n[ν]*Cθ[σ,ν]))
# F = (∂tC - βr*∂rC - βθ*∂θC)/α # + γ2*(@einsum γi[μ,ν]*C2[μ,ν,λ] - 0.5*γp[λ,σ]*gi[μ,ν]*C2[σ,μ,ν])
# ∂Cm = F + rhat[1]*∂rC + rhat[2]*∂θC
# #c4rθ = Dr2(fdr,U,r,θ,ns,_ds,x,y) - Dθ2(fdθ,U,r,θ,ns,_ds,x,y)
# #c4θr = -c4rθ
# ∂tUp = ∂tP + rhat[1]*∂tdr + rhat[2]*∂tdθ# - γ2*∂tg
# ∂tUm = ∂tP - rhat[1]*∂tdr - rhat[2]*∂tdθ# - γ2*∂tg
# ∂tU0 = θhat[1]*∂tdr + θhat[2]*∂tdθ
# #∂tU0 = ()∂tdx + ∂tdz
# ∂tUmb = @einsum Q4[μ,ν,α,β]*∂tUm[α,β]
# ∂tUmb -= sqrt(2)*cm*(@einsum Q3[α,μ,ν]*∂Cm[α]) # Constraint preserving BCs
# ∂tU0b = ∂tU0# + c0*(rhat[1]*θhat[2]*c4θr + rhat[2]*θhat[1]*c4rθ)
# #∂tUmb = @einsum O[μ,ν,α,β]*∂th[α,β] # Incoming Gravitational waveform
# # Time derivatives are OVERWRITTEN here, but still depends on evolution values
# ∂tP = 0.5*(∂tUp + ∂tUmb)
# ∂tdr = 0.5*(∂tUp - ∂tUmb)*rhat_[1] + ∂tU0b*θhat_[1]
# ∂tdθ = 0.5*(∂tUp - ∂tUmb)*rhat_[2] + ∂tU0b*θhat_[2]
#Axis regularity, acts as a generic boundary
if (y==1 || y==ns[2]) && false
if y==1 p=-1 else p=1 end
rhat_ = @Vec [0.,-p]
rnorm = @einsum γi2[i,j]*rhat_[i]*rhat_[j]
rhat_ = rhat_/sqrt(rnorm)
rhat = @einsum γi2[i,j]*rhat_[j]
# It is now θhat that points OUT of the domain
θhat = @Vec [-1.,0.]
θnorm = @einsum γ[i,j]*θhat[i]*θhat[j]
θhat = θhat/sqrt(θnorm)
θhat_ = @einsum γ[i,j]*θhat[j]
cp = α - βr*θhat_[1] - βθ*θhat_[2]
cm = -α - βr*θhat_[1] - βθ*θhat_[2]
c0 = - βr*θhat_[1] - βθ*θhat_[2]
βdotr = βr*rhat_[1] + βθ*rhat_[2]
Up = P + θhat[1]*dr + θhat[2]*dθ
U0 = rhat[1]*dr + rhat[2]*dθ
Dt = StateTensor{Type}((0.,1.,0.,1.,1.,0.))
Dρ = StateTensor{Type}((1.,0.,1.,0.,0.,1.))
# Condition ∂tgμν = 0 on the boundary
Umbt = (cp/cm)*Up - 2*(βdotr/cm)*U0
# Condition ∂ρgμν = 0 on the boundary
Umbρ = Up
#Umb = Dt.*Umbt + Dρ.*Umbρ
Umb = Umbt
#SAT type boundary conditions
ε = 2*abs(cm)*_ds[2]
Pb = 0.5*(Up + Umb)
drb = 0.5*(Up - Umb)*θhat_[1] + U0*rhat_[1]
dθb = 0.5*(Up - Umb)*θhat_[2] + U0*rhat_[2]
∂tP += ε*(Pb - P)
∂tdr += ε*(drb - dr)
∂tdθ += ε*(dθb - dθ)
end
@inline function pack(U::StateVector{Type},∂tU::StateVector{Type}) where Type
# Give names to stored arrays from the state vector
g = U.g
dx = U.dr
dy = U.dθ
P = U.P
∂tψv = ∂tU.ψ
∂tg = ∂tU.g
∂tdx = ∂tU.dr
∂tdy = ∂tU.dθ
∂tP = ∂tU.P
χ = g[2,2]
∂xχ = dx[2,2]
∂yχ = dy[2,2]
∂nχ = P[2,2]
gρρ = exp(2*χ)
∂xgρρ = 2*gρρ*∂xχ
∂ygρρ = 2*gρρ*∂yχ
Pρρ = 2*gρρ*∂nχ
∂tgρρ = ∂tg[2,2]
∂tdxρρ = ∂tdx[2,2]
∂tdyρρ = ∂tdy[2,2]
∂tPρρ = ∂tP[2,2]
#χ = 0.5*log(gρρ)
∂tχ = 0.5*∂tgρρ/gρρ
∂t∂xχ = 0.5*∂tdxρρ/gρρ - 0.5*∂tgρρ*∂xgρρ/gρρ^2
∂t∂yχ = 0.5*∂tdyρρ/gρρ - 0.5*∂tgρρ*∂ygρρ/gρρ^2
∂t∂nχ = 0.5*∂tPρρ/gρρ - 0.5*∂tgρρ*Pρρ/gρρ^2
# Rescale the ρρ component of the metric to make it the literal metric
∂tg = replace_comp(∂tg,∂tχ)
∂tdx = replace_comp(∂tdx,∂t∂xχ)
∂tdy = replace_comp(∂tdy,∂t∂yχ)
∂tP = replace_comp(∂tP,∂t∂nχ)
return StateVector{Type}(∂tψv,∂tg,∂tdx,∂tdy,∂tP)
end
# if iter == 1
# U2[x,y] = Uxy + dt*∂tU
# elseif iter == 2
# U3[x,y] = (3/4)*U1[x,y] + (1/4)*Uxy + (1/4)*dt*∂tU
# elseif iter == 3
# U1[x,y] = (1/3)*U1[x,y] + (2/3)*Uxy + (2/3)*dt*∂tU
# end
# End bit for RK4 low storage
# if iter in (1,2)
# Un1[x,y] = dt*∂tU
# elseif iter == 3
# Un1[x,y] = dt*∂tU - 0.5*Un1[x,y]
# elseif iter == 4
# Un1[x,y] = dt*∂tU + 2*Un1[x,y]
# end
#@parallel_indices (x,y) function add!(A,B::Tuple,b::Tuple)
# @inbounds A[x,y] = sum(getindex.(B,x,y).*b)
# return
# end
# @parallel_indices (x,y) function copy!(A,B)
# @inbounds A[x,y] = B[x,y]
# return
# end
# @parallel_indices (x,y) function add!(A,B,b::Number)
# @inbounds A[x,y] += b*B[x,y]
# return
# end
# @parallel_indices (x,y) function combine!(A,B,C,b::Number,c::Number)
# @inbounds A[x,y] = b*B[x,y] + c*C[x,y]
# return
# end
# @parallel_indices (x,y) function update!(A,B,C,b::Number,c::Number)
# @inbounds A[x,y] += b*B[x,y] + c*C[x,y]
# return
# end
# @inline function u(x,y,U) # scalar gradient-flux
# # Slice the State Vector
# Uxy = U[x,y]
# # Give names to stored arrays from the state vector
# g = Uxy.g
# dr = Uxy.dr
# dθ = Uxy.dθ
# P = Uxy.P
# # Unpack the metric into indiviual components
# gtt,gtr,gtθ,_,grr,grθ,_,gθθ,_,_ = g.data
# # Calculate lapse and shift
# det = grr*gθθ - grθ^2
# βr = (gtr*gθθ-gtθ*grθ)/det
# βθ = (gtθ*grr-gtr*grθ)/det
# α = sqrt(-gtt + grr*βr^2 + 2*grθ*βr*βθ + gθθ*βθ^2)
# return βr*dr + βθ*dθ - α*P
# end
# @inline function vr(x,y,U) # r component of the divergence-flux
# # Slice the State Vector
# Uxy = U[x,y]
# # Give names to stored arrays from the state vector
# g = Uxy.g
# dr = Uxy.dr
# dθ = Uxy.dθ
# P = Uxy.P
# # Unpack the metric into indiviual components
# gtt,gtr,gtθ,_,grr,grθ,_,gθθ,_,gϕϕ = g.data
# # Calculate lapse and shift
# det = grr*gθθ - grθ^2
# βr = (gtr*gθθ-gtθ*grθ)/det
# βθ = (gtθ*grr-gtr*grθ)/det
# α = sqrt(-gtt + grr*βr^2 + 2*grθ*βr*βθ + gθθ*βθ^2)
# # Calculate inverse components
# γirr = gθθ/det; γirθ = -grθ/det;
# return Aθ2(rootγ,U,x,y)*(βr*P - α*(γirr*dr + γirθ*dθ))
# end
# @inline function vθ(x,y,U) # θ component of the divergence-flux
# # Slice the State Vector
# Uxy = U[x,y]
# # Give names to stored arrays from the state vector
# g = Uxy.g
# dr = Uxy.dr
# dθ = Uxy.dθ
# P = Uxy.P
# # Unpack the metric into indiviual components
# gtt,gtr,gtθ,_,grr,grθ,_,gθθ,_,gϕϕ = g.data
# # Calculate lapse and shift
# det = grr*gθθ - grθ^2
# βr = (gtr*gθθ-gtθ*grθ)/det
# βθ = (gtθ*grr-gtr*grθ)/det
# α = sqrt(-gtt + grr*βr^2 + 2*grθ*βr*βθ + gθθ*βθ^2)
# # Calculate inverse components
# γirθ = -grθ/det; γiθθ = grr/det;
# #return (βθ*P - α*(γirθ*dr + γiθθ*dθ))
# return Aθ2(rootγ,U,x,y)*(βθ*P - α*(γirθ*dr + γiθθ*dθ))
# end
# @inline function rootγ(x,y,U)
# # Slice the State Vector
# Uxy = U[x,y]
# # Give names to stored arrays from the state vector
# g = Uxy.g
# # Unpack the metric into indiviual components
# _,_,_,_,grr,grθ,_,gθθ,_,gϕϕ = g.data
# det = grr*gθθ - grθ^2
# return sqrt(det*gϕϕ)
# end
# @inline function Base.:+(A::StateVector{T},B::StateVector{T}) where T
# g = A.g .+ B.g
# dx = A.dx .+ B.dx
# dθ = A.dθ .+ B.dθ
# P = A.P .+ B.P
# return StateVector{T}(g,dr,dθ,P)
# end
# @inline function Base.:-(A::StateVector{T},B::StateVector{T}) where T
# g = A.g .- B.g
# dr = A.dr .- B.dr
# dθ = A.dθ .- B.dθ
# P = A.P .- B.P
# return StateVector{T}(g,dr,dθ,P)
# end
# @inline function Base.:*(a::Number,A::StateVector{T}) where T
# g = a*A.g
# dr = a*A.dr
# dθ = a*A.dθ
# P = a*A.P
# return StateVector{T}(g,dr,dθ,P)
# end
# @inline function Base.:*(A::StateVector{T},B::StateVector{T}) where T
# g = A.g.*B.g
# dr = A.dr.*B.dr
# dθ = A.dθ.*B.dθ
# P = A.P.*B.P
# return StateVector{T}(g,dr,dθ,P)
# end
if c1 p=-1 else p=1 end
st_ = @Vec [0.0,p*sin(θ[x,y]),0.0,p*cos(θ[x,y])]
snorm = @einsum gi[μ,ν]*st_[μ]*st_[ν]
s_ = st_/sqrt(snorm)
s = @einsum gi[μ,ν]*s_[ν]
r_vec = @Vec [p*sin(θ[x,y]),0.0,p*cos(θ[x,y])]
rvec = @einsum γi3[i,j]*r_vec[j]
rnorm = @einsum γ[i,j]*rvec[i]*rvec[j]
rhat = rvec/sqrt(rnorm)
#s = @Vec [0.0,rhat[1],rhat[2],rhat[3]]
r_hat = r_vec/sqrt(rnorm)
Θt = @Vec [0.0,s_[4],0.0,-s_[2]]
Θnorm = @einsum g[μ,ν]*Θt[μ]*Θt[ν]
Θ = Θt/sqrt(Θnorm)
θvec = @Vec [r_vec[3],0.0,-r_vec[1]]
θnorm = @einsum γ[i,j]*θvec[i]*θvec[j]
θhat = θvec/sqrt(θnorm)
#θ4 = @Vec [0.0,θhat[1],θhat[2],θhat[3]]
θ_hat = @einsum γ[i,j]*θhat[j]
#cp = α - βx*r_hat[1] - βz*r_hat[3]
cm = -α - βx*r_hat[1] - βz*r_hat[3]
c0 = - βx*r_hat[1] - βz*r_hat[3]
#βθ = βx*θ_hat[1] + βz*θ_hat[3]
# Up = P + rhat[1]*dx + rhat[3]*dz
# U0 = θhat[1]*dx + θhat[3]*dz
# Boundary Condition:
# You get to choose the incoming
# characteristic modes (Um)
# Pick a function Um = f(Up,U0)
l = @einsum (n[α] + s[α])/sqrt(2)
k = @einsum (n[α] - s[α])/sqrt(2)
l_ = @einsum g[μ,α]*l[α]
Θ_ = @einsum g[μ,α]*Θ[α]
#k_ = @einsum g[μ,α]*k[α]
#σ = StateTensor((μ,ν) -> gi[μ,ν] + k[μ]*l[ν] + l[μ]*k[ν])
σ_ = StateTensor((μ,ν) -> g[μ,ν] + n_[μ]*n_[ν] - s_[μ]*s_[ν])
σ = @einsum gi[μ,α]*gi[ν,β]*σ_[α,β]
σm = @einsum gi[μ,α]*σ_[ν,α] # mixed indices (raised second index)
#δ4 = one(SymmetricFourthOrderTensor{4})
δ = one(SymmetricSecondOrderTensor{4})
γp = @einsum δ[μ,ν] + n_[μ]*n[ν]
Q4 = SymmetricFourthOrderTensor{4}(
(μ,ν,α,β) -> σ_[μ,ν]*σ[α,β]/2 - 2*l_[μ]*σm[ν,α]*k[β] + l_[μ]*l_[ν]*k[α]*k[β]
) # Four index constraint projector (indices down down up up)
Q3 = Tensor{Tuple{@Symmetry{4,4},4}}(
(μ,ν,α) -> l_[μ]*σm[ν,α] - σ_[μ,ν]*l[α]/2 - l_[μ]*l_[ν]*k[α]/2
) # Three index constraint projector (indices down down up)
#Pij = @einsum δ3[i,j] - rhat[i]*r_hat[j]
# O = SymmetricFourthOrderTensor{4}(
# (μ,ν,α,β) -> σm[μ,α]*σm[ν,β] - σ_[μ,ν]*σ[α,β]/2
# ) # Gravitational wave projector
# Pl = Tensor{Tuple{@Symmetry{4,4},4}}((μ,ν,α) -> l[μ]*δ[ν,α] - l_[α]*gi[μ,ν]/2)
# Pθ = Tensor{Tuple{@Symmetry{4,4},4}}((μ,ν,α) -> Θ[μ]*δ[ν,α] - Θ_[α]*gi[μ,ν]/2)
#Um1 = @einsum (sqrt(2)/2)*Pl[μ,ν,α]*Up[μ,ν] + Pθ[μ,ν,α]*U0[μ,ν] - Hxy[α]
# Condition ∂tgμν = 0 on the boundary
#Um2 = (cp/cm)*Up - 2*(βθ/cm)*U0
#Um2 = P - rhat[1]*dx - rhat[3]*dz
#-sqrt(2)*Q3[μ,ν,α]*Um1[α]
#Um = @einsum -sqrt(2)*Q3[μ,ν,α]*Um1[α]# + δ4[μ,ν,α,β]*Um2[α,β] - Q4[μ,ν,α,β]*Um2[α,β]
#Um = Um2
#SAT type boundary conditions
#ε = 2*abs(cm)*_ds[1]
# Pb = 0.5*(Up + Um)
# dxb = 0.5*(Up - Um)*r_hat[1] + U0*θ_hat[1]
# dzb = 0.5*(Up - Um)*r_hat[3] + U0*θ_hat[3]
# ∂tPμν += ε*(Pb - P)
# ∂tdxμν += ε*(dxb - dx)
# ∂tdzμν += ε*(dzb - dz)
∂tα = -0.5*α*(@einsum n[μ]*n[ν]*∂tg[μ,ν])
∂tβ = α*(@einsum γi[α,μ]*n[ν]*∂tg[μ,ν]) # result is a 4-vector
∂t∂tg = (βx*∂tdx + βz*∂tdz - α*∂tP) + (∂tβ[2]*dx + ∂tβ[4]*dz - ∂tα*P)
∂t∂g = Tensor{Tuple{4,@Symmetry{4,4}}}((σ,μ,ν) -> (σ==1 ? ∂t∂tg[μ,ν] : σ==2 ? ∂tdx[μ,ν] : σ==3 ? 0.0 : σ==4 ? ∂tdz[μ,ν] : @assert false))
# ∂∂g = SymmetricFourthOrderTensor{4}(
# (ϵ,σ,μ,ν) -> ϵ==1 ? (σ==1 ? ∂t∂tg[μ,ν] : σ==2 ? ∂tdx[μ,ν] : σ==3 ? 0.0 : σ==4 ? ∂tdz[μ,ν] : @assert false) :
# ϵ==2 ? (σ==1 ? ∂tdx[μ,ν] : σ==2 ? ∂xdx[μ,ν] : σ==3 ? 0.0 : σ==4 ? ∂xdz[μ,ν] : @assert false) :
# ϵ==3 ? (σ==1 ? 0.0 : σ==2 ? 0.0 : σ==3 ? 0.0 : σ==4 ? 0.0 : @assert false) :
# ϵ==4 ? (σ==1 ? ∂tdz[μ,ν] : σ==2 ? ∂xdz[μ,ν] : σ==3 ? 0.0 : σ==4 ? ∂zdz[μ,ν] : @assert false) : @assert false
# ) # use this to do the spatial derivatives of the constraints the way the paper does it
∂tΓ = Tensor{Tuple{4,@Symmetry{4,4}}}((σ,μ,ν) -> 0.5*(∂t∂g[ν,μ,σ] + ∂t∂g[μ,ν,σ] - ∂t∂g[σ,μ,ν]))
∂tH = Vec{4}((∂Hxy[1,:]...))
∂xH = Vec{4}((∂Hxy[2,:]...))
∂zH = Vec{4}((∂Hxy[4,:]...))
∂tC = (@einsum gi[ϵ,σ]*∂tΓ[λ,ϵ,σ] - gi[μ,ϵ]*gi[ν,σ]*Γ[λ,μ,ν]*∂tg[ϵ,σ]) - ∂tH
# set up finite differencing for the constraints, by defining a function
# that calculates the constraints for any x and y index. This
# might not be the best idea, but should work.
∂xC = DxC(constraints,U,r,θ,ns,_ds,x,y) - ∂xH + 0.5*γ2*(@einsum (n_[σ]*gi[μ,ν]*Cx[μ,ν] - n[ν]*Cx[σ,ν]))
∂zC = DzC(constraints,U,r,θ,ns,_ds,x,y) - ∂zH + 0.5*γ2*(@einsum (n_[σ]*gi[μ,ν]*Cx[μ,ν] - n[ν]*Cx[σ,ν]))
F = (∂tC - βx*∂xC - βz*∂zC)/α + γ2*(@einsum γi[μ,ν]*C2[μ,ν,λ] - 0.5*γp[λ,σ]*gi[μ,ν]*C2[σ,μ,ν])
∂Cm = F + rhat[1]*∂xC + rhat[3]*∂zC
c4xz = Dx2(fdz,U,r,θ,ns,_ds,x,y) - Dz2(fdx,U,r,θ,ns,_ds,x,y)
c4zx = -c4xz
∂tUp = ∂tP + rhat[1]*∂tdx + rhat[3]*∂tdz# - γ2*∂tg
∂tUm = ∂tP - rhat[1]*∂tdx - rhat[3]*∂tdz# - γ2*∂tg
∂tU0 = θhat[1]*∂tdx + θhat[3]*∂tdz
#∂tU0 = ()∂tdx + ∂tdz
∂tUmb = @einsum Q4[μ,ν,α,β]*∂tUm[α,β]
∂tUmb -= sqrt(2)*cm*(@einsum Q3[μ,ν,α]*∂Cm[α]) # Constraint preserving BCs
∂tU0b = ∂tU0 + c0*(rhat[1]*θhat[3]*c4zx + rhat[3]*θhat[1]*c4xz)
#∂tUmb = @einsum O[μ,ν,α,β]*∂th[α,β] # Incoming Gravitational waveform
# Time derivatives are OVERWRITTEN here, but still depends on evolution values
∂tP = 0.5*(∂tUp + ∂tUmb)
∂tdx = 0.5*(∂tUp - ∂tUmb)*r_hat[1] + ∂tU0b*θ_hat[1]
∂tdz = 0.5*(∂tUp - ∂tUmb)*r_hat[3] + ∂tU0b*θ_hat[3]
# @parallel_indices (x,y) function rhs!(U1,U2,U3,H,∂H_sym,r,θ,ns,dt,_ds,iter)
# # Explicit slices from main memory
# if iter == 1
# U = U1
# Uxy = U[x,y]
# elseif iter == 2
# U = U2
# Uxy = U[x,y]
# elseif iter == 3
# U = U3
# Uxy = U[x,y]
# end
# Hxy = H[x,y]; ∂H_symxy = ∂H_sym[x,y];
# # Machinery for rescaling
# # Λ
# # Λi
# # Give names to stored arrays from the state vector
# g = Uxy.g
# dr = Uxy.dr
# dθ = Uxy.dθ
# P = Uxy.P
# # Unpack the tensor type into indiviual components
# gtt, gtr, gtθ,_, grr, grθ,_, gθθ,_, gϕϕ = g.data
# drtt,drtr,drtθ,_,drrr,drrθ,_,drθθ,_,drϕϕ = dr.data
# dθtt,dθtr,dθtθ,_,dθrr,dθrθ,_,dθθθ,_,dθϕϕ = dθ.data
# Ptt, Ptr, Ptθ,_, Prr, Prθ,_, Pθθ,_, Pϕϕ = P.data
# # Calculate lapse and shift
# det = grr*gθθ - grθ^2
# βr = (gtr*gθθ-gtθ*grθ)/det
# βθ = (gtθ*grr-gtr*grθ)/det
# β = @Vec [0.0,βr,βθ,0.0]
# # if x==1 && y==1
# # println(x," ",y," ",grr," ",gθθ," ",gϕϕ," ")
# # end
# if -gtt + grr*βr^2 + 2*grθ*βr*βθ + gθθ*βθ^2 < 0
# println(x," ",y," ",grr," ",gθθ," ",gϕϕ," ")
# end
# α = sqrt(-gtt + grr*βr^2 + 2*grθ*βr*βθ + gθθ*βθ^2)
# γ1 = -1.
# γ2 = 0.
# # Calculate time derivative of the metric
# ∂tgμν = ((1+γ1)*(βr*Dr2(fg,U,ns,x,y)*_ds[1] + βθ*Dθ2(fg,U,ns,x,y)*_ds[2])
# - γ1*(βr*dr + βθ*dθ) - α*P)
# # Time derivative of the metric (get rid of this?)
# ∂tgtt = βr*drtt + βθ*dθtt - α*Ptt; ∂tgtr = βr*drtr + βθ*dθtr - α*Ptr;
# ∂tgtθ = βr*drtθ + βθ*dθtθ - α*Ptθ; ∂tgrr = βr*drrr + βθ*dθrr - α*Prr;
# ∂tgrθ = βr*drrθ + βθ*dθrθ - α*Prθ; ∂tgθθ = βr*drθθ + βθ*dθθθ - α*Pθθ;
# ∂tgϕϕ = βr*drϕϕ + βθ*dθϕϕ - α*Pϕϕ;
# ∂tg = βr*dr + βθ*dθ - α*P
# # Calculate inverse components
# γirr = gθθ/det; γirθ = -grθ/det; γiθθ = grr/det; γiϕϕ = 1.0/gϕϕ;
# γi = StateTensor((0.0,0.0,0.0,0.0,γirr,γirθ,0.0,γiθθ,0.0,γiϕϕ))
# nt = 1.0/α; nx = -βr/α; ny = -βθ/α;
# n = @Vec [nt,nx,ny,0.0]
# n_ = @Vec [-α,0.0,0.0,0.0]
# # gitt = -nt^2; gitr = -nt*nx; girr = γirr-nx^2;
# # gitθ = -nt*ny; girθ = γirθ-nx*ny; giθθ = γiθθ-ny^2;
# # giϕϕ = γiϕϕ
# # rootγ = sqrt(det*gϕϕ)
# gi = symmetric(@einsum γi[μ,ν] - n[μ]*n[ν])
# #gi = StateTensor((gitt,gitr,gitθ,0.0,girr,girθ,0.0,giθθ,0.0,giϕϕ))
# ∂g = Tensor{Tuple{4,@Symmetry{4,4}}}(
# (∂tgtt,drtt,dθtt,0.0,∂tgtr,drtr,dθtr,0.0,∂tgtθ,drtθ,dθtθ,0.0,0.0,0.0,0.0,0.0,
# ∂tgrr,drrr,dθrr,0.0,∂tgrθ,drrθ,dθrθ,0.0,0.0,0.0,0.0,0.0,
# ∂tgθθ,drθθ,dθθθ,0.0,0.0,0.0,0.0,0.0,∂tgϕϕ,drϕϕ,dθϕϕ,0.0))
# Γ = Tensor{Tuple{4,@Symmetry{4,4}}}(
# (σ,μ,ν) -> 0.5*(∂g[ν,μ,σ] + ∂g[μ,ν,σ] - ∂g[σ,μ,ν])
# )
# C = @einsum Hxy[μ] - gi[ϵ,σ]*Γ[μ,ϵ,σ]
# # if (x == 100 && y == 3 && iter==4)
# # display(C)
# # end
# # Define Stress energy tensor and trace
# T = zero(StateTensor)
# Tt = 0.
# δ = one(StateTensor)
# γ0 = 1.
# ∂tPμν = 8*pi*Tt*g - 16*pi*T + 2*∂H_symxy
# ∂tPμν -= @einsum gi[ϵ,σ]*Hxy[ϵ]*∂g[μ,ν,σ]
# ∂tPμν -= @einsum gi[ϵ,σ]*Hxy[ϵ]*∂g[ν,μ,σ]
# ∂tPμν += @einsum 2*gi[ϵ,σ]*gi[λ,ρ]*∂g[λ,ϵ,μ]*∂g[ρ,σ,ν]
# ∂tPμν -= @einsum 2*gi[ϵ,σ]*gi[λ,ρ]*Γ[μ,ϵ,λ]*Γ[ν,σ,ρ]
# # ∂tPμν -= @einsum 0.5*γi[i,j]*∂g[k,i,j]*γi[k,l]*∂g[l,μ,ν]
# #∂tPμν += @einsum -1.0*(δ[ϵ,μ]*n_[ν] + δ[ϵ,ν]*n_[μ] - g[μ,ν]*n[ϵ])*C[ϵ]
# ∂tPμν *= α
# ∂tPμν -= @einsum 0.5*γi[i,j]*∂tg[i,j]*P[μ,ν]
# # ∂tPμν += @einsum 0.5*γi[i,j]*β[k]*∂g[k,i,j]*P[μ,ν]
# # ∂tPμν -= @einsum (0.5*α)*γi[i,j]*∂g[k,i,j]*γi[k,l]*∂g[l,μ,ν]
# #∂tPμν += Div_∂(vr,vθ,k,ns,_ds,x,y)
# #∂tPμν += Div(vr,vθ,U,ns,_ds,x,y)
# ∂tPμν += Div(vr,vθ,U,ns,_ds,x,y)
# ∂tdrμν = Dr2(u,U,ns,x,y)*_ds[1] + α*γ2*(Dr2(fg,U,ns,x,y)*_ds[1] - dr)
# ∂tdθμν = Dθ2(u,U,ns,x,y)*_ds[2] + α*γ2*(Dθ2(fg,U,ns,x,y)*_ds[2] - dθ)
# ∂tPμν = symmetric(∂tPμν)
# ∂tU = StateVector(∂tgμν,∂tdrμν,∂tdθμν,∂tPμν)
# if x==100 && y==1 && iter == 1
# println("")
# #display(vθ(x,y,U))
# display(∂tgμν)
# display(∂tdrμν)
# display(∂tdθμν)
# display(∂tPμν)
# println("")
# end
# #∂tU = zero(StateVector{Float64})
# # End bit for SSP RK3
# if iter == 1
# U2[x,y] = Uxy + dt*∂tU
# elseif iter == 2
# U3[x,y] = (3/4)*U1[x,y] + (1/4)*Uxy + (1/4)*dt*∂tU
# elseif iter == 3
# U1[x,y] = (1/3)*U1[x,y] + (2/3)*Uxy + (2/3)*dt*∂tU
# end
# # End bit for RK4 low storage
# # if iter in (1,2)
# # Un1[x,y] = dt*∂tU
# # elseif iter == 3
# # Un1[x,y] = dt*∂tU - 0.5*Un1[x,y]
# # elseif iter == 4
# # Un1[x,y] = dt*∂tU + 2*Un1[x,y]
# # end
# return
# end
macro sum(indices, expr)
(parse_sum(expr,indices))
end
function parse_sum(expr,indices)
@assert indices isa Expr
@assert indices.head === :tuple
#@assert expr.head === :+=
inds = indices.args
@assert !isempty(inds)
@assert all(ind isa Symbol for ind in inds)
n = length(inds)
terms = []
iters = inds
for iters in Iterators.product([1:4 for i in 1:n]...)
assignments = Expr(:block,[Expr(:(=), esc(inds[i]), iters[i]) for i in 1:n]...)
body = esc(expr)
expr′ = Expr(:let, assignments, body)
push!(terms, expr′)
end
# terms2 = []
# for part in Iterators.partition(terms,4)
# push!(terms2,Expr(:call, :+, part...))
# end
# res = Expr(:call, :+, terms2...)
# if n <= 2
# res = Expr(:call, :+, terms...)
# else
# terms2 = []
# for part in Iterators.partition(terms,16)
# push!(terms2,Expr(:call, :+, part...))
# end
# res = Expr(:call, :+, terms2...)
# end
res = Expr(:block, terms...)
return res
end
# function parse_sum(expr,indices)
# @assert indices isa Expr
# @assert indices.head === :tuple
# inds = indices.args
# @assert !isempty(inds)
# @assert all(ind isa Symbol for ind in inds)
# n = length(inds)
# terms = []
# iters = inds
# for iters in Iterators.product([1:4 for i in 1:n]...)
# assignments = Expr(:block,[Expr(:(=), esc(inds[i]), iters[i]) for i in 1:n]...)
# body = esc(expr)
# expr′ = Expr(:let, assignments, body)
# push!(terms, expr′)
# end
# # terms2 = []
# # for part in Iterators.partition(terms,4)
# # push!(terms2,Expr(:call, :+, part...))
# # end
# # res = Expr(:call, :+, terms2...)
# if n <= 2
# res = Expr(:call, :+, terms...)
# else
# terms2 = []
# for part in Iterators.partition(terms,16)
# push!(terms2,Expr(:call, :+, part...))
# end
# res = Expr(:call, :+, terms2...)
# end
# return res
# end
# iters = indices
# #ranges =
# if expr isa Expr
# @inline f(indices...) = expr
# +([f(iters...) for iters in Iterators.product([1:4 for i in 1:n]...)]...)
# end
# # Abort if we find something unexpected
# println(typeof(expr))
# @assert false
# end
# plot(Array(θ[2,1:res:end]), Array(∂ₜU.x[var][1:res:end,1]));
# ylims!(-100, 100)
# frame(anim)
# println(mean(∂ₜU.x[var][1:res:end,1]))
function RK4!(Un,Un1,H,∂H,r,θ,ns,dt,_ds)
rxy = r[x,y]; θxy = θ[x,y];
Hxy = H[x,y]
∂Hxy = ∂H[x,y]
Unxy = Un[x,y] # Explicit read from system memory
#Un1xy = Un1[x,y]
#########################################
# Begin 4th order Runge-Kutta algorithm
Un1xy = Unxy
∂tUxy = rhs(Unxy,Hxy,∂Hxy,rxy,θxy,ns,_ds)
#BC_r!(∂ₜU,Un,gauge,t,rmax,θ[1,:],dr)
Un1xy = Un1xy + (dt/6)*∂tUxy
kxy = Unxy + (dt/2)*∂tUxy
∂tUxy = rhs(kxy,Hxy,∂Hxy,rxy,θxy,ns,_ds)
#BC_r!(∂ₜU,k,gauge,t,rmax,θ[1,:],dr)
Un1xy = Un1xy + (dt/3)*∂tUxy
kxy = Unxy + (dt/2)*∂tUxy
∂tUxy = rhs(kxy,Hxy,∂Hxy,rxy,θxy,ns,_ds)
# BC_r!(∂ₜU,k,gauge,t,rmax,θ[1,:],dr)
Un1xy = Un1xy + (dt/3)*∂tUxy
kxy = Unxy + dt*∂tUxy
∂tUxy = rhs(kxy,Hxy,∂Hxy,rxy,θxy,ns,_ds)
# BC_r!(∂ₜU,k,gauge,t,rmax,θ[1,:],dr)
Un1xy = Un1xy + (dt/6)*∂tUxy
# End 4th order Runge-Kutta algorithm
#######################################
Un1[x,y] = Un1xy # Explicit save to system memory
return
end
# @inline function Base.zero(::Type{StateStorage{T}}) where T
# g = NTuple{7,T}((0.0,0.0,0.0,0.0,0.0,0.0,0.0))
# dr = NTuple{7,T}((0.0,0.0,0.0,0.0,0.0,0.0,0.0))
# dθ = NTuple{7,T}((0.0,0.0,0.0,0.0,0.0,0.0,0.0))
# P = NTuple{7,T}((0.0,0.0,0.0,0.0,0.0,0.0,0.0))
# return StateStorage(g,dr,dθ,P)
# end
# @inline function add!(A::StateVector{T},B::StateVector{T},c::T)
# A.g.x .+= c*B.g.x
# A.dr.x .+= c*B.dr.x
# A.dθ.x .+= c*B.dθ.x
# A.P.x .+= c*B.P.x
# end
# @inline function lin_comb!(A::StateVector{T},B::StateVector{T},C::StateVector{T},c::T)
# A.g.x .= B.g.x .+ c*C.g.x
# A.dr.x .= B.dr.x .+ c*C.dr.x
# A.dθ.x .= B.dθ.x .+ c*C.dθ.x
# A.P.x .= B.P.x .+ c*C.P.x
# end
# Sample analytic functions to the grid
# function sample!(f, fun, ns, r, θ, μ...)
# f .= Data.Array([fun(r[i,j],θ[i,j],μ...) for i in 1:ns[1], j in 1:ns[2]])
# end
# @inline function index2linear(μ::Int,ν::Int)
# (μ,ν) == (1,1) && return 1
# (μ,ν) == (1,2) && return 2
# (μ,ν) == (2,1) && return 2
# (μ,ν) == (1,3) && return 3
# (μ,ν) == (3,1) && return 3
# (μ,ν) == (2,2) && return 4
# (μ,ν) == (2,3) && return 5
# (μ,ν) == (3,2) && return 5
# (μ,ν) == (3,3) && return 6
# (μ,ν) == (4,4) && return 7
# @assert false
# end