forked from WaterLily-jl/WaterLily.jl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Multiphase.jl
1132 lines (989 loc) · 38.1 KB
/
Multiphase.jl
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
using ForwardDiff
using Printf
using JLD2
using Combinatorics
using Statistics: mean
using StaticArrays
using Interpolations
using Random
using CUDA
"""
cVOF{D::Int, T::Float, Sf<:AbstractArray{T,D}, Vf<:AbstractArray{T,D+1}}
Composite type for 2D or 3D two-phase advection scheme.
The heavy fluid is advected using operator-split conservative volume-of-fluid method proposed by [Weymouth & Yue (2010)](https://doi.org/10.1016/j.jcp.2009.12.018).
This guarentees mass conservation and preserves sharp interface across fluids.
The primary variable is the volume fraction of the heavy fluid, the cell-averaged color function, `f`.
We use it to reconstruct sharp interface.
"""
struct cVOF{D, T, Sf<:AbstractArray{T}, Vf<:AbstractArray{T}}
f :: Sf # cell-averaged color function (volume fraction field, VOF)
f⁰:: Sf # cell-averaged color function. Need to store it because Heun Correction step
fᶠ:: Sf # place to store flux or smoothed VOF
fᵐ:: Sf # place to store VOF value at a face due to the surface tension step
n̂ :: Vf # normal vector of the surfaces in cell
α :: Sf # intercept of intercace in cell: norm ⋅ x = α
c̄ :: AbstractArray{Int8} # color function at the cell center
perdir :: NTuple # periodic directions
dirdir :: NTuple # Dirichlet directions
λρ :: T # ratio of density (air/water)
λμ :: T # ratio of dynamic viscosity (air/water)
η :: T # the surface tension
ke ::Vector{T}
keN::Vector{T}
f1 :: Sf
function cVOF(N::NTuple{D}; arr=Array, InterfaceSDF::Function=(x) -> 5-x[1], T=Float64, perdir=(0,), dirdir=(0,),λμ=1e-2,λρ=1e-3,η=0) where D
Ng = N .+ 2 # scalar field size
Nd = (Ng..., D) # vector field size
f = ones(T, Ng) |> arr
fᶠ = copy(f)
fᵐ = copy(f)
n̂ = zeros(T, Nd) |> arr
α = zeros(T, Ng) |> arr
c̄ = zeros(Int8, Ng) |> arr
applyVOF!(f,α,n̂,InterfaceSDF)
BCVOF!(f,α,n̂;perdir=perdir,dirdir=dirdir)
f⁰ = copy(f)
smoothVOF!(0, f, fᶠ, α;perdir=perdir)
f1 = ones(T, Ng) |> arr
new{D,T,typeof(f),typeof(n̂)}(f,f⁰,fᶠ,fᵐ,n̂,α,c̄,perdir,dirdir,λρ,λμ,η,[],[],f1)
end
end
calke = false
"""
mom_step!(a::Flow,b::AbstractPoisson,c::cVOF,d::AbstractBody)
Integrate the `Flow` one time step using the [Boundary Data Immersion Method](https://eprints.soton.ac.uk/369635/)
and the `AbstractPoisson` pressure solver to project the velocity onto an incompressible flow.
"""
@fastmath function mom_step!(a::Flow{D},b::AbstractPoisson,c::cVOF,d::AbstractBody) where D
a.u⁰ .= a.u;
smoothStep = 2
# predictor u → u'
U = BCTuple(a.U,time(a),D)
advect!(a,c,c.f,a.u⁰,a.u); measure!(a,d,c;t=0,ϵ=1)
smoothVOF!(smoothStep, c.f⁰, c.fᶠ, c.α;perdir=c.perdir)
calke && calke!(a.σ,a.u,c.fᶠ,c.f1,c.λρ,c.ke,c.keN)
a.u .= 0
ConvDiffSurf!(a.f,a.u⁰,a.σ,c.f⁰,c.fᶠ,c.fᵐ,c.α,c.n̂,c.λμ,c.λρ,a.ν,c.η,perdir=a.perdir)
accelerate!(a.f,time(a),a.g,a.U)
BDIM!(a); BC!(a.u,U,a.exitBC,a.perdir)
calke && calke!(a.σ,a.u,c.f,c.f1,c.λρ,c.ke,c.keN)
calculateL!(a,c); update!(b)
project!(a,b); BC!(a.u,U,a.exitBC,a.perdir)
calke && calke!(a.σ,a.u,c.f,c.f1,c.λρ,c.ke,c.keN)
# corrector u → u¹
U = BCTuple(a.U,timeNext(a),D)
advect!(a,c,c.f⁰,a.u⁰,a.u); measure!(a,d,c;t=0,ϵ=1)
smoothVOF!(smoothStep, c.f, c.fᶠ, c.α;perdir=c.perdir)
ConvDiffSurf!(a.f,a.u,a.σ,c.f,c.fᶠ,c.fᵐ,c.α,c.n̂,c.λμ,c.λρ,a.ν,c.η,perdir=a.perdir)
accelerate!(a.f,timeNext(a),a.g,a.U)
BDIM!(a); scale_u!(a,0.5); BC!(a.u,U,a.exitBC,a.perdir)
calke && calke!(a.σ,a.u,c.fᶠ,c.f1,c.λρ,c.ke,c.keN)
calculateL!(a,c); update!(b)
project!(a,b,0.5); BC!(a.u,U,a.exitBC,a.perdir)
calke && calke!(a.σ,a.u,c.fᶠ,c.f1,c.λρ,c.ke,c.keN)
c.f .= c.f⁰
push!(a.Δt,min(CFL(a,c),1.1a.Δt[end]))
end
function ConvDiffSurf!(r,u,Φ,f,fᶠ,fbuffer,α,n̂,λμ,λρ,ν,η;perdir=(0,))
r .= 0.
N,n = size_u(u)
for i ∈ 1:n, j ∈ 1:n
# if it is periodic direction
tagper = (j in perdir)
# treatment for bottom boundary with BCs
lowBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,Val{tagper}())
# inner cells
@loop (
Φ[I] = -calculateμ(i,j,I,fᶠ,λμ,ν)*(∂(j,CI(I,i),u)+∂(i,CI(I,j),u));
r[I,i] += Φ[I];
) over I ∈ inside_u(N,j)
@loop r[I-δ(j,I),i] -= Φ[I] over I ∈ inside_u(N,j)
# treatment for upper boundary with BCs
upperBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,Val{tagper}())
end
η≠0 && surfTen!(r,f,fbuffer,α,n̂,η;perdir)
for i ∈ 1:n
@loop r[I,i] /= calculateρ(i,I,fᶠ,λρ) over I ∈ inside(Φ)
end
for i ∈ 1:n, j ∈ 1:n
# if it is periodic direction
tagper = (j in perdir)
# treatment for bottom boundary with BCs
lowBoundaryConv!(r,u,Φ,ν,i,j,N,Val{tagper}())
# inner cells
@loop (
Φ[I] = ϕu(j,CI(I,i),u,ϕ(i,CI(I,j),u));
r[I,i] += Φ[I];
) over I ∈ inside_u(N,j)
@loop r[I-δ(j,I),i] -= Φ[I] over I ∈ inside_u(N,j)
# treatment for upper boundary with BCs
upperBoundaryConv!(r,u,Φ,ν,i,j,N,Val{tagper}())
end
end
# Neumann BC Building block
lowBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,::Val{false}) = @loop r[I,i] += -calculateμ(i,j,I,fᶠ,λμ,ν)*(∂(j,CI(I,i),u)+∂(i,CI(I,j),u)) over I ∈ slice(N,2,j,2)
lowBoundaryConv!(r,u,Φ,ν,i,j,N,::Val{false}) = @loop r[I,i] += ϕuL(j,CI(I,i),u,ϕ(i,CI(I,j),u)) over I ∈ slice(N,2,j,2)
upperBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,::Val{false}) = @loop r[I-δ(j,I),i] += calculateμ(i,j,I,fᶠ,λμ,ν)*(∂(j,CI(I,i),u)+∂(i,CI(I,j),u)) over I ∈ slice(N,N[j],j,2)
upperBoundaryConv!(r,u,Φ,ν,i,j,N,::Val{false}) = @loop r[I-δ(j,I),i] += -ϕuR(j,CI(I,i),u,ϕ(i,CI(I,j),u)) over I ∈ slice(N,N[j],j,2)
# Periodic BC Building block
lowBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,::Val{true}) = @loop (
Φ[I] = -calculateμ(i,j,I,fᶠ,λμ,ν)*(∂(j,CI(I,i),u)+∂(i,CI(I,j),u));
r[I,i] += Φ[I]
) over I ∈ slice(N,2,j,2)
lowBoundaryConv!(r,u,Φ,ν,i,j,N,::Val{true}) = @loop (
Φ[I] = ϕuP(j,CIj(j,CI(I,i),N[j]-2),CI(I,i),u,ϕ(i,CI(I,j),u));
r[I,i] += Φ[I]
) over I ∈ slice(N,2,j,2)
upperBoundaryDiff!(r,u,Φ,fᶠ,λμ,ν,i,j,N,::Val{true}) = @loop r[I-δ(j,I),i] -= Φ[CIj(j,I,2)] over I ∈ slice(N,N[j],j,2)
upperBoundaryConv!(r,u,Φ,ν,i,j,N,::Val{true}) = @loop r[I-δ(j,I),i] -= Φ[CIj(j,I,2)] over I ∈ slice(N,N[j],j,2)
function measure!(a::Flow,body::NoBody,c::cVOF;t=0,ϵ=1) a.μ₀ .= 1 end
function measure!(a::Flow,b::AbstractPoisson,c::cVOF,d::AbstractBody,t=0)
measure!(a,d,c;t=0,ϵ=1)
calculateL!(a,c)
update!(b)
end
@fastmath @inline function MaxTotalflux(I::CartesianIndex{d},u) where {d}
s = zero(eltype(u))
for i in 1:d
s += @inbounds(max(abs(u[I,i]),abs(u[I+δ(i,I),i])))
end
return s
end
function CFL(a::Flow{D},c::cVOF;Δt_max=10) where D
@inside a.σ[I] = flux_out(I,a.u)
fluxLimit = inv(maximum(@views a.σ[inside(a.σ)])+5*a.ν*max(1,c.λμ/c.λρ))
@inside a.σ[I] = MaxTotalflux(I,a.u)
cVOFLimit = 0.5*inv(maximum(@views a.σ[inside(a.σ)]))
surfTenLimit = sqrt((1+c.λρ)/(8π*c.η)) # 8 from kelli's code
gravLimit = isnothing(a.g) ? Δt_max : 1/√sum((i)->a.g(i,time(a))^2,1:D)
0.8min(Δt_max,fluxLimit,cVOFLimit,surfTenLimit,gravLimit)
# 0.03/maximum(abs,a.u)
end
# function myCFL(a::Flow,c::cVOF)
# @inside a.σ[I] = flux_out(I,a.u)
# tCFL = inv(maximum(@views a.σ[inside(a.σ)]))
# tFr = inv(√sum((i)->i^2,a.g))
# tRe = 3/14*inv(a.ν*max(1,c.λμ/c.λρ))^2
# @inside a.σ[I] = MaxTotalflux(I,a.u)
# tCOF = 0.5*inv(maximum(@views a.σ[inside(a.σ)]))
# 0.2min(10.,tCFL,tFr,tRe,tCOF)
# end
"""
advect!(a::Flow{n}, c::cVOF, f=c.f, u¹=a.u⁰, u²=a.u)
This is the spirit of the operator-split cVOF calculation.
It calculates the volume fraction after one fluxing.
Volume fraction field `f` is being fluxed with the averaged of two velocity -- `u¹` and `u²`.
"""
advect!(a::Flow{D}, c::cVOF, f=c.f, u¹=a.u⁰, u²=a.u) where {D} = updateVOF!(
a.Δt[end], f, c.fᶠ, c.n̂, c.α, u¹, u², c.c̄; perdir=a.perdir,dirdir=c.dirdir
)
function updateVOF!(
δt, f::AbstractArray{T,D}, fᶠ::AbstractArray{T,D},
n̂::AbstractArray{T,Dv}, α::AbstractArray{T,D},
u::AbstractArray{T,Dv}, u⁰::AbstractArray{T,Dv}, c̄; perdir=(0,),dirdir=(0,)
) where {T,D,Dv}
tol = 10eps(eltype(f))
# Gil Strang splitting: see https://www.asc.tuwien.ac.at/~winfried/splitting/
# if D==2
# opOrder = @SArray[2,1,2]
# opCoeff = @SArray[0.5,1.0,0.5]
# elseif D==3
# opOrder = @SArray[3,2,1,2,3]
# opCoeff = @SArray[0.5,0.5,1.0,0.5,0.5]
# end
# Go to the quasi-Strang scheme:
# I alterate the order of direction split to avoid bias.
# TODO: this array allocation take too much time but D is not known during the compilation time so static array not possible
opOrder = shuffle(1:D)
opCoeff = ones(T,D)
# calculate for dilation term
@loop c̄[I] = f[I] <= 0.5 ? 0 : 1 over I ∈ CartesianIndices(f)
for iOp ∈ CartesianIndices(opOrder)
fᶠ .= 0
d = opOrder[iOp]
uMulp = opCoeff[iOp]*δt
reconstructInterface!(f,α,n̂,perdir=perdir,dirdir=dirdir)
getVOFFaceFlux!(d,f,α,n̂,u,u⁰,uMulp,fᶠ)
@loop (
f[I] += -∂(d,I+δ(d,I),fᶠ) + c̄[I]*(∂(d,I,u)+∂(d,I,u⁰))*0.5uMulp
) over I ∈ inside(f)
# report errors if overfill or overempty
maxf, maxid = findmax(f)
minf, minid = findmin(f)
if maxf-1 > tol
CUDA.@allowscalar du⁰,du = abs(div(maxid,u⁰)),abs(div(maxid,u))
@printf(" |∇⋅u⁰| = %+13.8f, |∇⋅u| = %+13.8f\n",du⁰,du)
errorMsg = "max VOF @ $(maxid.I) ∉ [0,1] @ iOp=$iOp which is direction $d, Δf = $(maxf-1)"
# (du⁰+du > 10) && error(errorMsg)
# try
# error(errorMsg)
# catch e
# Base.printstyled("ERROR: "; color=:red, bold=true)
# Base.showerror(stdout, e, Base.catch_backtrace()); println()
# end
end
if minf < -tol
CUDA.@allowscalar du⁰,du = abs(div(minid,u⁰)),abs(div(minid,u))
@printf(" |∇⋅u⁰| = %+13.8f, |∇⋅u| = %+13.8f\n",du⁰,du)
errorMsg = "min VOF @ $(minid.I) ∉ [0,1] @ iOp=$iOp which is direction $d, Δf = $(-minf)"
# (du⁰+du > 10) && error(errorMsg)
# try
# error(errorMsg)
# catch e
# Base.printstyled("ERROR: "; color=:red, bold=true)
# Base.showerror(stdout, e, Base.catch_backtrace()); println()
# end
end
# cleanup Wisp
cleanWisp!(f,tol)
BCVOF!(f,α,n̂,perdir=perdir,dirdir=dirdir)
end
end
"""
reconstructInterface!(f,α,n̂)
Reconstruct interface from volume fraction field, involving normal calculation and then the intercept.
Normal reconstruction follows the central difference algorithm
proposed by [Pilliod & Puckett (2004)](https://doi.org/10.1016/j.jcp.2003.12.023) and further
modified by [Weymouth & Yue (2010)](https://doi.org/10.1016/j.jcp.2009.12.018).
"""
function reconstructInterface!(f,α,n̂;perdir=(0,),dirdir=(0,))
N,n = size_u(n̂)
@loop reconstructInterface!(f,α,n̂,N,I,perdir=perdir,dirdir=dirdir) over I ∈ inside(f)
BCVOF!(f,α,n̂,perdir=perdir,dirdir=dirdir)
end
function reconstructInterface!(f::AbstractArray{T,n},α::AbstractArray{T,n},n̂::AbstractArray{T,nv},N,I;perdir=(0,),dirdir=(0,)) where {T,n,nv}
fc = f[I]
if (fc==0.0 || fc==1.0)
for i∈1:n n̂[I,i] = 0 end
else
# getInterfaceNormal_WY!(f,n̂,N,I;perdir,dirdir)
getInterfaceNormal_MYC!(f,n̂,N,I)
# getInterfaceNormal_CD!(f,n̂,I)
# getInterfaceNormal_PCD!(f,n̂,I)
# getInterfaceNormal_SLIC!(f,n̂,I)
# getInterfaceNormal_XYLIC!(f,n̂,I,2)
α[I] = getIntercept(n̂,I, fc)
end
end
"""
getInterfaceNormal_WY!(f,n̂,N,I)
Normal reconstructure scheme from [Weymouth & Yue (2010)](https://doi.org/10.1016/j.jcp.2009.12.018). It's 3x3 compact height function with some checks.
"""
function getInterfaceNormal_WY!(f::AbstractArray{T,n},n̂,N,I;perdir=(0,),dirdir=(0,)) where {T,n}
getInterfaceNormal_CD!(f,n̂,I)
dc = myargmax(n,n̂,I)
for d ∈ 1:n
if (d == dc)
n̂[I,d] = copysign(1.0,n̂[I,d])
else
hu = get3CellHeight(I+δ(d,I), f, dc)
hc = get3CellHeight(I , f, dc)
hd = get3CellHeight(I-δ(d,I), f, dc)
n̂[I,d] = -(hu-hd)*0.5
if d ∉ dirdir && d ∉ perdir
if I[d] == N[d]-1
n̂[I,d] = -(hc - hd)
elseif I[d] == 2
n̂[I,d] = -(hu - hc)
end
# elseif (hu+hd==0.0 || hu+hd==6.0)
# nhat .= 0.0
elseif abs(n̂[I,d]) > 0.5
if (n̂[I,d]*(f[I]-0.5) >= 0.0)
n̂[I,d] = -(hu - hc)
else
n̂[I,d] = -(hc - hd)
end
end
end
end
end
"""
getInterfaceNormal_MYC!(f,nhat,N,I)
Mixed Youngs-Centered normal reconstructure scheme from [Aulisa et al. (2007)](https://doi.org/10.1016/j.jcp.2007.03.015), but I think best explained by
[Duz (2005) page 81](https://doi.org/10.4233/uuid:e204277d-c334-49a2-8b2a-8a05cf603086) and [Baraldi et al. (2014)](http://doi.org/10.1016/j.compfluid.2013.12.018).
One can also be referred to the source code of [PARIS](http://www.ida.upmc.fr/~zaleski/paris/). It is in vofnonmodule.f90.
"""
function getInterfaceNormal_MYC!(f::AbstractArray{T,n},n̂,N,I) where {T,n}
nhat = @views n̂[I,:]
getInterfaceNormal_Y!(f,nhat,I)
CCNhat = zeros(T,n)
curNhat = zeros(T,n)
curm0 = 0
CCiz = 0
for iz∈1:n
curNhat .= getInterfaceNormal_CCi(f,nhat,I,iz)
if abs(curNhat[iz])>curm0 CCNhat .= curNhat; CCiz = iz end
curm0 = abs(curNhat[iz])
end
if abs(CCNhat[CCiz]) < maximum(abs,nhat)
nhat .= CCNhat
end
end
"""
getInterfaceNormal_CCi!(f,nCD,I,dc)
Normal reconstructure scheme from Center column method but only in `dc` direction.
Assume we have already calculated a guessed normal to set the direction (sign) of interface in `nCD`.
"""
function getInterfaceNormal_CCi(f::AbstractArray{T,n},nCD,I,dc) where {T,n}
nhat = zeros(T,n)
for d ∈ 1:n
if (d == dc)
nhat[d] = copysign(1.0,nCD[d])
else
hu = get3CellHeight(I+δ(d,I), f, dc)
hd = get3CellHeight(I-δ(d,I), f, dc)
nhat[d] = -(hu-hd)*0.5
end
end
return nhat./sum(abs,nhat)
end
"""
getInterfaceNormal_Y!(f, nhat, I)
Calculate the interface normal from [Youngs (1982)](https://www.researchgate.net/publication/249970655_Time-Dependent_Multi-material_Flow_with_Large_Fluid_Distortion).
Note that `nhat` is view of `n̂[I,:]`.
"""
function getInterfaceNormal_Y!(f::AbstractArray{T,D},nhat,I) where {T,D}
for d ∈ 1:D
nhat[d] = (YoungSum(f,I-δ(d,I),d) - YoungSum(f,I+δ(d,I),d))*0.5
end
nhat ./= sum(abs,nhat)
end
function YoungSum(f,I,d)
δxy = oneunit(I)-δ(d,I)
a = 0
for II∈I-δxy:I
for III∈II:II+δxy
a+=f[III]
end
end
return a
end
"""
getInterfaceNormal_CD!(f, nhat, I)
Calculate the interface normal from the central difference scheme with the closest neighbor considered (4 neighbor in 3D).
Note that `nhat` is view of `n̂[I,:]`.
"""
function getInterfaceNormal_CD!(f::AbstractArray{T,n},n̂,I) where {T,n}
for d ∈ 1:n
n̂[I,d] = (crossSummation(f,I-δ(d,I),d)-crossSummation(f,I+δ(d,I),d))*0.5
end
end
function crossSummation(f::AbstractArray{T,n},I,d,γ=1.0) where {T,n}
a = f[I]
# for iDir∈getAnotherDir(d,n)
# a += f[I-δ(iDir,I)]+f[I+δ(iDir,I)]
# end
for iDir∈1:n
a += iDir≠d ? γ*(f[I-δ(iDir,I)]+f[I+δ(iDir,I)]) : 0
end
return a
end
function getInterfaceNormal_PCD!(f::AbstractArray{T,n},n̂,I) where {T,n}
for d ∈ 1:n
n̂[I,d] = (f[I-δ(d,I)]-f[I+δ(d,I)])*0.5
end
end
function getInterfaceNormal_SLIC!(f::AbstractArray{T,n},n̂,I) where {T,n}
getInterfaceNormal_CD!(f,n̂,I)
maxdir = myargmax(n,n̂,I)
nSign = sign(n̂[I,maxdir])
for iDir∈1:n
n̂[I,iDir] = 0
end
n̂[I,maxdir] = nSign
end
function getInterfaceNormal_XYLIC!(f::AbstractArray{T,n},n̂,I,d=2) where {T,n}
for i∈1:n
n̂[I,i] = ifelse(i==d,1,0)
end
end
"""
getVOFFaceFlux!(d,f,α,n̂,u,u⁰,uMulp,fᶠ)
- `d`: the direction of cell faces that flux is calculated at
- `f`: volume fraction field
- `α`: intercept
- `n̂`: interface normal
- `u`, `u⁰`: the VOF is fluxed with the average of two velocity
- `uMulp`: the multiplier of the velocity, to take care of operator splitting coefficients and time step size
- `fᶠ`: where the flux is stored
"""
function getVOFFaceFlux!(d,f,α,n̂,u,u⁰,uMulp,fᶠ)
fᶠ .= 0.0
@loop fᶠ[IFace] = getVOFFaceFlux!(d,f,α,n̂,0.5*(u[IFace,d]+u⁰[IFace,d])*uMulp,IFace) over IFace ∈ inside_uWB(size(f),d)
end
function getVOFFaceFlux!(d,fIn::AbstractArray{T,n},α::AbstractArray{T,n},n̂::AbstractArray{T,nv},dl,IFace::CartesianIndex) where {T,n,nv}
ICell = IFace;
flux = 0.0
if dl == 0.0
else
if (dl > 0.0) ICell -= δ(d,IFace) end
f = fIn[ICell]
sumAbsNhat = 0
for ii∈1:n sumAbsNhat+= abs(n̂[ICell,ii]) end
if (sumAbsNhat==0.0 || f == 0.0 || f == 1.0)
flux = f*dl
else
dl = dl
a = α[ICell]
if (dl > 0.0) a -= n̂[ICell,d]*(1.0-dl) end
nhatOrig = n̂[ICell,d]
n̂[ICell,d] *= abs(dl)
flux = getVolumeFraction(n̂,ICell, a)*dl
n̂[ICell,d] = nhatOrig
end
end
return flux
end
"""
smoothVelocity!(a::Flow,b::AbstractPoisson,c::cVOF,d::AbstractBody,oldp)
Smooth the velocity with top hat filter base on algorithm proposed by [Fu et al. (2010)](https://arxiv.org/abs/1410.1818), as the shear velocity is not well-resolved across fluid interface.
We smooth the area where air dominates (α≤0.5, I suppose there is typo in eq. (1)).
Note that we need an additional `oldp` variable to store the old pressure field in order to avoid the potential field here messing up with the old one.
"""
function smoothVelocity!(a::Flow,b::AbstractPoisson,c::cVOF,d::AbstractBody,oldp;ω=1)
oldp .= a.p; a.p .= 0
a.u⁰ .= a.u;
# smooth velocity field base on the (smoothed) VOF field
smoothVOF!(0, c.f, c.fᶠ, c.α;perdir=c.perdir)
smoothVelocity!(a.u,c.fᶠ,c.n̂,c.λρ)
@. a.u = ω*a.u + (1-ω)*a.u⁰
BC!(a.u,a.U,a.exitBC,a.perdir)
# update the poisson solver and project the smoothed velcity field into the solenoidal velocity field
measure!(a,d,c;t=0,ϵ=1)
calculateL!(a,c)
update!(b)
project!(a,b);
BC!(a.u,a.U,a.exitBC,a.perdir)
a.p .= oldp
# reporting routine
@loop a.σ[I] = div(I,a.u) over I ∈ inside(a.p)
diver = max(maximum(@views a.σ[inside(a.p)]),-minimum(@views a.σ[inside(a.p)]))
@printf("Smoothed velocity: ∇⋅u = %.6e, nPois = %2d, res0 = %.6e, res = %.6e\n", diver, b.n[end], b.res0[end], b.res[end])
# remove footprint from the general logging
pop!(b.res); pop!(b.res0); pop!(b.n)
pop!(a.Δt)
push!(a.Δt,min(CFL(a,c),1.1a.Δt[end]))
end
function smoothVelocity!(u::AbstractArray{T,dv}, f::AbstractArray{T,d}, buffer::AbstractArray{T,dv},λρ) where {T,d,dv}
buffer .= 0
for i∈1:d
@loop smoothVelocity!(u,f,buffer,λρ,i,I) over I ∈ inside(f)
end
u .= buffer
end
function smoothVelocity!(u::AbstractArray{T,dv}, f::AbstractArray{T,d}, buffer::AbstractArray{T,dv},λρ,i,I) where {T,d,dv}
fM = ϕ(i,I,f)
if fM<=0.5
a = zero(eltype(u))
# for II ∈ boxAroundI(I)
# rhoII = calculateρ(i,II,f,λρ)
# buffer[I,i] += rhoII*u[II,i]
# a += rhoII
# end
for j∈1:d
rhoI0 = calculateρ(i,I-δ(j,I),f,λρ)
rhoI1 = calculateρ(i,I,f,λρ)
rhoI2 = calculateρ(i,I+δ(j,I),f,λρ)
buffer[I,i] += rhoI0*u[I-δ(j,I),i] + 2rhoI1*u[I,i] + rhoI2*u[I+δ(j,I),i]
a += rhoI0 + 2rhoI1 + rhoI2
end
buffer[I,i] /= a
else
buffer[I,i] = u[I,i]
end
end
"""
applyVOF!(f,α,n̂,FreeSurfsdf)
Given a distance function (FreeSurfsdf) for the initial free-surface, yield the volume fraction field (`f`).
Assume the gradient at the center is the normal vector. Use cell center to estimate the distance.
"""
function applyVOF!(f::AbstractArray{T,D},α::AbstractArray{T,D},n̂::AbstractArray{T,Dv},FreeSurfsdf::Function) where {T,D,Dv}
# set up the field
@loop applyVOF!(f,α,n̂,FreeSurfsdf,I) over I ∈ inside(f)
# Clear Wisps in the flow
cleanWisp!(f)
end
function applyVOF!(f::AbstractArray{T,D},α::AbstractArray{T,D},n̂::AbstractArray{T,Dv},FreeSurfsdf::Function,I::CartesianIndex{D}) where {T,D,Dv}
α[I] = FreeSurfsdf(loc(0,I)) # the coordinate of the cell center
n = ForwardDiff.gradient(FreeSurfsdf, loc(0,I))
for i∈1:D n̂[I,i] = n[i] end
if any(isnan.(n))
for i∈1:D
xyzpδ = SVector{D,T}(loc(0,I).+0.01 .*δ(i,I).I)
xyzmδ = SVector{D,T}(loc(0,I).-0.01 .*δ(i,I).I)
n̂[I,i] = FreeSurfsdf(xyzpδ) - FreeSurfsdf(xyzmδ)
end
end
sumN = 0; sumN2= 0; for i∈1:D sumN += n̂[I,i]; sumN2+= n̂[I,i]^2 end
α[I] = 0.5sumN-√sumN2*α[I]
f[I] = getVolumeFraction(n̂,I,α[I])
end
"""
smoothVOF!(itm, f, sf, rf)
Smooth the cell-centered VOF field with moving average technique.
itm: smooth steps
f: befor smooth
sf: after smooth
rf: buffer
"""
function smoothVOF!(itm, f::AbstractArray{T,d}, sf::AbstractArray{T,d}, rf::AbstractArray{T,d};perdir=(0,),kelli=false) where {T,d}
(itm!=0)&&(rf .= f)
for it ∈ 1:itm
sf .= 0
@loop sumAvg!(sf,rf,I) over I ∈ inside(rf)
BC!(sf;perdir)
rf .= sf
end
kelli && interpol!(sf)
(itm==0)&&(sf .= f)
end
function sumAvg!(sf::AbstractArray{T,d},rf::AbstractArray{T,d},I) where {T,d}
α,β,γ = 1,1,2
for j∈1:d
sf[I] += α*rf[I+δ(j, I)] + β*rf[I-δ(j, I)] + γ*rf[I]
end
sf[I] /= (α+β+γ)*d
end
function interpol!(f)
fin = SA[0.0,0.000128601,0.00270062,0.0239198,0.116512,0.344136,0.655864,0.883488,0.97608,0.997299,0.999871,1.0]
fout= SA[0,0.00104741,0.0123377,0.0397531,0.131237,0.347321,0.664065,0.929867,1,1,1,1]
nterp_linear = linear_interpolation(fin, fout)
@loop f[I] = nterp_linear(f[I]) over I ∈ CartesianIndices(f)
end
"""
BCVOF!(f,α,n̂)
Apply boundary condition to volume fraction, intercept, and normal with Neumann or Periodic ways
"""
function BCVOF!(f,α,n̂;perdir=(0,),dirdir=(0,))
N,n = size_u(n̂)
for j ∈ 1:n
if j in perdir
@loop f[I] = f[CIj(j,I,N[j]-1)] over I ∈ slice(N,1,j)
@loop f[I] = f[CIj(j,I,2)] over I ∈ slice(N,N[j],j)
for i ∈ 1:n
@loop n̂[I,i] = n̂[CIj(j,I,N[j]-1),i] over I ∈ slice(N,1,j)
@loop n̂[I,i] = n̂[CIj(j,I,2),i] over I ∈ slice(N,N[j],j)
end
@loop α[I] = α[CIj(j,I,N[j]-1)] over I ∈ slice(N,1,j)
@loop α[I] = α[CIj(j,I,2)] over I ∈ slice(N,N[j],j)
elseif j in dirdir
else
@loop f[I] = f[I+δ(j,I)] over I ∈ slice(N,1,j)
@loop f[I] = f[I-δ(j,I)] over I ∈ slice(N,N[j],j)
end
end
end
"""
getIntercept(v, g)
Calculate intersection from volume fraction.
These functions prepare `n̂` and `g` for `f2α`.
Following algorithm proposed by [Scardovelli & Zaleski (2000)](https://doi.org/10.1006/jcph.2000.6567).
"""
getIntercept(n̂::AbstractArray{T,3},I::CartesianIndex{2},g) where T = getIntercept(n̂[I,1],n̂[I,2],zero(T),g)
getIntercept(n̂::AbstractArray{T,4},I::CartesianIndex{3},g) where T = getIntercept(n̂[I,1],n̂[I,2],n̂[I,3],g)
getIntercept(v::AbstractArray{T,1}, g) where T = (
length(v)==2 ?
getIntercept(v[1], v[2], zero(T), g) :
getIntercept(v[1], v[2], v[3], g)
)
function getIntercept(n1, n2, n3, g)
t = abs(n1) + abs(n2) + abs(n3)
if g != 0.5
m1, m2, m3 = sort3(abs(n1)/t, abs(n2)/t, abs(n3)/t)
a = f2α(m1, m2, m3, ifelse(g < 0.5, g, 1.0 - g))
else
a = 0.5
end
return ifelse(g < 0.5, a, 1.0 - a)*t + min(n1, 0.0) + min(n2, 0.0) + min(n3, 0.0)
end
"""
getVolumeFraction(v, b)
Calculate intersection from volume fraction.
These functions prepare `n̂` and `b` for `α2f`.
Following algorithm proposed by [Scardovelli & Zaleski (2000)](https://doi.org/10.1006/jcph.2000.6567).
"""
getVolumeFraction(n̂::AbstractArray{T,3},I::CartesianIndex{2},b) where T = getVolumeFraction(n̂[I,1],n̂[I,2],zero(T),b)
getVolumeFraction(n̂::AbstractArray{T,4},I::CartesianIndex{3},b) where T = getVolumeFraction(n̂[I,1],n̂[I,2],n̂[I,3],b)
getVolumeFraction(v::AbstractArray{T,1}, b) where T = (
length(v)==2 ?
getVolumeFraction(v[1], v[2], zero(T), b) :
getVolumeFraction(v[1], v[2], v[3], b)
)
function getVolumeFraction(n1, n2, n3, b)
t = abs(n1) + abs(n2) + abs(n3)
a = (b - min(n1, 0.0) - min(n2, 0.0) - min(n3, 0.0))/t
if a <= 0.0 || a == 0.5 || a >= 1.0
return min(max(a, 0.0), 1.0)
else
m1, m2, m3 = sort3(abs(n1)/t, abs(n2)/t, abs(n3)/t)
t = α2f(m1, m2, m3, ifelse(a < 0.5, a, 1.0 - a))
return ifelse(a < 0.5, t, 1.0 - t)
end
end
"""
α2f(m1, m2, m3, a)
Three-Dimensional Forward Problem.
Get volume fraction from intersection.
This is restricted to (1) 3D, (2) n̂ᵢ ≥ 0 ∀ i, (3) ∑ᵢ n̂ᵢ = 1, (4) a < 0.5.
Following algorithm proposed by [Scardovelli & Zaleski (2000)](https://doi.org/10.1006/jcph.2000.6567).
"""
function α2f(m1, m2, m3, a)
m12 = m1 + m2
if a < m1
f3 = a^3/(6.0*m1*m2*m3)
elseif a < m2
f3 = a*(a - m1)/(2.0*m2*m3) + ifelse(m2 == 0.0, 1.0, m1 / m2) * (m1 / (6.0 * m3)) # change proposed by Kelli Hendricson to avoid the divided by zero issue
elseif a < min(m3, m12)
f3 = (a^2*(3.0*m12 - a) + m1^2*(m1 - 3.0*a) + m2^2*(m2 - 3.0*a))/(6*m1*m2*m3)
elseif m3 < m12
f3 = (a^2*(3.0 - 2.0*a) + m1^2*(m1 - 3.0*a) + m2^2*(m2 - 3.0*a) + m3^2*(m3 - 3.0*a))/(6*m1*m2*m3)
else
f3 = (2.0*a - m12)/(2.0*m3)
end
return f3
end
"""
f2α(m1, m2, m3, v)
Three-Dimensional Inverse Problem.
Get intercept with volume fraction.
This is restricted to (1) 3D, (2) n̂ᵢ ≥ 0 ∀ i, (3) ∑ᵢ n̂ᵢ = 1, (4) v < 0.5.
Following algorithm proposed by [Scardovelli & Zaleski (2000)](https://doi.org/10.1006/jcph.2000.6567).
"""
function f2α(m1, m2, m3, v)
m12 = m1 + m2
p = 6.0*m1*m2*m3
v1 = ifelse(m2 == 0.0, 1.0, m1 / m2) * (m1 / (6.0 * m3)) # change proposed by Kelli Hendricson to avoid the divided by zero issue
v2 = v1 + (m2 - m1)/(2.0*m3)
v3 = ifelse(
m3 < m12,
(m3^2*(3.0*m12 - m3) + m1^2*(m1 - 3.0*m3) + m2^2*(m2 - 3.0*m3))/p,
m12*0.5/m3
)
if v < v1
a3 = (p*v)^(1.0/3.0)
elseif v < v2
a3 = 0.5*(m1 + sqrt(m1^2 + 8.0*m2*m3*(v - v1)))
elseif v < v3
c0 = m1^3 + m2^3 - p*v
c1 = -3.0*(m1^2 + m2^2)
c2 = 3.0*m12
c3 = -1
a3 = proot(c0, c1, c2, c3)
elseif m3 < m12
c0 = m1^3 + m2^3 + m3^3 - p*v
c1 = -3.0*(m1^2 + m2^2 + m3^2)
c2 = 3
c3 = -2
a3 = proot(c0, c1, c2, c3)
else
a3 = m3*v + m12*0.5
end
return a3
end
"""
get3CellHeight(I, f, i)
Calculate accumulate liquid height (amount) of location `I` along `i`ᵗʰ direction (I-δᵢ, I, I+δᵢ).
"""
function get3CellHeight(I, f, i)
return f[I-δ(i,I)] + f[I] + f[I+δ(i,I)]
end
@inline calculateρ(d,I,f,λ) = (ϕ(d,I,f)*(1-λ) + λ)
@inline function calculateμ(i,j,I,f,λ,μ)
(i==j) && return (f[I-δ(i,I)]*(1-λ) + λ)*μ
n = length(I)
s = zero(eltype(f))
for II in (I-oneunit(I)):I
s += f[II]
# s += 1/(f[II]/1+(1-f[II])/λ)
end
s /= 2^n
return (s * (1-λ) + λ)*μ
# return s*μ
end
calculateL!(a::Flow{D}, c::cVOF) where {D} = calculateL!(a.μ₀,c.fᶠ,c.λρ,a.perdir)
function calculateL!(μ₀,f::AbstractArray{T,D},λρ,perdir) where {T,D}
for d ∈ 1:D
@loop μ₀[I,d] /= calculateρ(d,I,f,λρ) over I∈inside(f)
end
BC!(μ₀,zeros(SVector{D,T}),false,perdir)
end
# +++++++ Surface tension
function surfTen!(r,f::AbstractArray{T,D},fbuffer,α,n̂,η;perdir=(0,),dirdir=(0,)) where {T,D}
N = size(f)
for d∈1:D
n̂ .= 0
@loop fbuffer[I] = ϕ(d,I,f) over I∈inside(f)
BC!(fbuffer;perdir)
@loop containInterface(fbuffer[I]) && getInterfaceNormal_WY!(fbuffer,n̂,N,I) over I ∈ inside(f)
@loop r[I,d] += containInterface(fbuffer[I]) ? η*getCurvature(I,fbuffer,majorDir(n̂,I))*-∂(d,I,f) : zero(T) over I∈inside(f)
end
end
"""
getCurvature(I,f,i)
Formula from [Patel et al. (2019)](https://doi.org/10.1016/j.compfluid.2019.104263) or on [Basilisk.fr](http://basilisk.fr/src/curvature.h).
Cross derivaties from [Wikipedia](https://en.wikipedia.org/wiki/Finite_difference#Multivariate_finite_differences).
This function has been dispatched for 2D and 3D.
"""
function getCurvature(I::CartesianIndex{3},f::AbstractArray{T,3},i) where {T}
ix,iy = getXYdir(i)
H = @SMatrix [
getPopinetHeight(I+xUnit*δd(ix,I)+yUnit*δd(iy,I),f,i)
for xUnit∈-1:1,yUnit∈-1:1
]
Hx = (H[3,2] - H[1,2])/2
Hy = (H[2,3] - H[2,1])/2
filter = 0.2
Hxx= (
(H[3,2] + H[1,2] - 2*H[2,2]) +
(H[3,1] + H[1,1] - 2*H[2,1])*filter +
(H[3,3] + H[1,3] - 2*H[2,3])*filter
)/(1+2*filter)
Hyy= (
(H[2,3] + H[2,1] - 2*H[2,2]) +
(H[1,3] + H[1,1] - 2*H[1,2])*filter +
(H[3,3] + H[3,1] - 2*H[3,2])*filter
)/(1+2*filter)
Hxy= (H[3,3] + H[1,1] - H[3,1] - H[1,3])/4
return (Hxx*(1+Hy^2) + Hyy*(1+Hx^2) - 2Hxy*Hx*Hy)/(1+Hx^2+Hy^2)^1.5
end
function getCurvature(I::CartesianIndex{2},f::AbstractArray{T,2},i) where {T}
ix = getXdir(i)
H = @SArray [
getPopinetHeight(I+xUnit*δd(ix,I),f,i)
for xUnit∈-1:1
]
Hₓ = (H[3]-H[1])/2
Hₓₓ= (H[3]+H[1]-2H[2])
return Hₓₓ/(1+Hₓ^2)^1.5
end
"""
getPopinetHeight(I,f,i)
Calculate water height of a single column with methods considering the adaptive cell height and if not working, switch to the traditional 3x7 column configuration.
"""
function getPopinetHeight(I,f,i)
# H,consistent = getPopinetHeightAdaptive(I,f,i,false)
# consistent && return H
H,consistent = getPopinetHeightAdaptive(I,f,i,true)
# consistent && return H
# H = getPopinetHeightFixed3(I,f,i)
return H
end
"""
getPopinetHeightAdaptive(I,f,i)
Return the column height relative to cell `I` center along signed `i` direction, which points to where there is no water.
The function is based on the Algorithm 4 from [Popinet, JCP (2009)](https://doi.org/10.1016/j.jcp.2009.04.042).
If `monotonic` is activated, the summation will only cover the monotonic range. The monotonic condition is based on [Guo et al., Appl. Math. Model. (2015)](https://doi.org/10.1016/j.apm.2015.04.022).
"""
function getPopinetHeightAdaptive(I,f::AbstractArray{T,D},i,monotonic=true) where {T,D}
consistent = true
Inow = I; fnow = f[Inow]; H = (fnow-0.5)
# Iterate till reach the cell full of air
finishInd = fnow<1
while !finishInd || containInterface(fnow)
Inow += δd(i,I); !validCI(Inow,f) && break
fnow = ifelse(monotonic && f[Inow]>fnow, zero(T), f[Inow]) # type stability is important in ifelse in GPU...
H += fnow
finishInd = ifelse(containInterface(fnow),true,finishInd)
end
consistent = (fnow==0) && consistent
Inow = I; fnow = f[Inow]
# Iterate till reach the cell full of water
finishInd = fnow>0
while !finishInd || containInterface(fnow)
Inow -= δd(i,I); !validCI(Inow,f) && break
fnow = ifelse(monotonic && f[Inow]<fnow, one(T), f[Inow])
H += fnow-1 # a little trick that make `I` cell center the origin
finishInd = ifelse(containInterface(fnow),true,finishInd)
end
consistent = (fnow==1) && consistent
return H,consistent
end
"""
getPopinetHeightFixed3(I,f,i)
Traditional 3x7 height function proposed by [Cummins et al. (2005)](https://doi.org/10.1016/j.compstruc.2004.08.017).
"""
function getPopinetHeightFixed3(I,f,i,hh=3)
consistent = true
Inow = I; fnow = f[Inow]; H = (fnow-0.5)
# Iterate till reach the cell full of air
finishInd = fnow<1
for ii = 1:hh
Inow += δd(i,I); !validCI(Inow,f) && break
fnow = f[Inow]
H += fnow
end
consistent = (fnow==0) && consistent
Inow = I; fnow = f[Inow]
# Iterate till reach the cell full of water
finishInd = fnow>0
for ii = 1:hh
Inow -= δd(i,I); !validCI(Inow,f) && break
fnow = f[Inow]
H += fnow-1 # a little trick that make `I` cell center the origin
end
consistent = (fnow==1) && consistent
return H
end
getHeightFD(I,f,i) = f[I]
getHeightFixed1(I,f,i) = get3CellHeight(I,f,i)
"""
getCurvature2D_Fit(I,f,α,n̂)
Get curvature from parabola-fitting method with the constraint of interface point and interface normal.
"""
function getCurvature2D_Fit(I,f,α,n̂)
iy = majorDir(n̂,I)
ix = getXdir(iy)
point = []
norma = []
for II∈boxAroundI(I)
if containInterface(f[II]) && sum(abs,n̂[II,:])>0.1
coord = getInterfaceCenter(n̂,α,II).+II.I.-I.I
push!(point,transformCoord(coord,[ix,iy]))
push!(norma,transformCoord(n̂[II,:],[ix,iy]))
end
end
cenCoord = transformCoord(getInterfaceCenter(n̂,α,I),[ix,iy])
a = getPara2D(point,norma)
return 2a[1]/(1+(2a[1]*cenCoord[1]+a[2])^2)^1.5
end
"""
getPara2D(point,norma)
Return coefficients of 2d parabola from given points and normal.
Note that the parabola cannot be an inclined one it should either be y = f(x) or x = g(y). No xy term present.
"""
function getPara2D(point,norma)
nPoint = length(point)
A = zeros(2nPoint,3)
b = zeros(2nPoint)
for i∈1:nPoint
x,y = point[i]
nx,ny = norma[i]
A[2i-1:2i,:] = [x^2 x 1; 2ny*x ny 0]
b[2i-1:2i] = [y;-nx]
end
return (A'*A)\(A'*b)
end
"""
getInterfaceCenter(n̂,α,I)
To calculate the quasi-center of line or plane segments in cell `I` by projecting the cell center to the plane.
"""
function getInterfaceCenter(n̂::AbstractArray{T,nv},α::AbstractArray{T,n},I::CartesianIndex{n}) where{T,n,nv}
nLocal = @views n̂[I,:]
dis = (0.5sum(nLocal) - α[I])/√sum(abs2,nLocal)
return -dis*nLocal/√sum(abs2,nLocal)
end
# +++++++ Auxiliary functions for multiphase calculation
"""
proot(c0, c1, c2, c3)