-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtreecode3d_pb.f
980 lines (812 loc) · 28.9 KB
/
treecode3d_pb.f
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
MODULE treecode3d_procedures
C r8 is 8-byte (double precision) real
INTEGER,PARAMETER :: r8=SELECTED_REAL_KIND(12)
C global variables for taylor expansions
INTEGER :: torder,torderlim,torder2
REAL(KIND=r8),ALLOCATABLE,DIMENSION(:) :: cf
REAL(KIND=r8),ALLOCATABLE,DIMENSION(:) :: cf1,cf2,cf3
REAL(KIND=r8),ALLOCATABLE,DIMENSION(:,:,:) :: a,b
C global variables to track tree levels
INTEGER :: minlevel,maxlevel
C global variables used when computing potential/force
INTEGER :: orderoffset
REAL(KIND=r8),DIMENSION(3) :: tarpos,tarq
C ######################################
REAL(KIND=r8) :: tarchr,peng_old
C ######################################
C global variables for position and charge storage
C NOTE: arrays ARE NOT COPIED in this version!! orderarr is still valid
INTEGER,ALLOCATABLE,DIMENSION(:) :: orderarr
REAL(KIND=r8),ALLOCATABLE,DIMENSION(:) :: xcopy,ycopy,zcopy,qcopy
C node pointer and node type declarations
TYPE tnode_pointer
TYPE(tnode), POINTER :: p_to_tnode
END TYPE tnode_pointer
TYPE tnode
INTEGER :: numpar,ibeg,iend
REAL(KIND=r8) :: x_min,y_min,z_min
REAL(KIND=r8) :: x_max,y_max,z_max
REAL(KIND=r8) :: x_mid,y_mid,z_mid
REAL(KIND=r8) :: radius,aspect
INTEGER :: level,num_children,exist_ms
REAL(KIND=r8),DIMENSION(:,:,:,:),POINTER :: ms
TYPE(tnode_pointer), DIMENSION(8) :: child
END TYPE tnode
C#######################################
TYPE(tnode), POINTER::troot
C#######################################
CONTAINS
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE SETUP(x,y,z,q,numpars,order,iflag,xyzminmax)
IMPLICIT NONE
C
C SETUP allocates and initializes arrays needed for the Taylor expansion.
C Also, global variables are set and the Cartesian coordinates of
C the smallest box containing the particles is determined. The particle
C postions and charges are copied so that they can be restored upon exit.
C
INTEGER,INTENT(IN) :: numpars,order,iflag
REAL(KIND=r8),DIMENSION(numpars),INTENT(IN) :: x,y,z,q
REAL(KIND=r8),INTENT(INOUT),DIMENSION(6) :: xyzminmax
C local variables
INTEGER :: err,i,j,k
REAL(KIND=r8) :: t1
C global integers and reals: TORDER, TORDERLIM and THETASQ
C############################################################
torder = order+2
torder2=order
C############################################################
IF (iflag .EQ. 1) THEN
orderoffset=0
ELSE
orderoffset = 1
END IF
torderlim = torder+orderoffset
C allocate global Taylor expansion variables
ALLOCATE(cf(0:torder), STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocationg Taylor variables! '
STOP
END IF
ALLOCATE(cf1(torderlim),cf2(torderlim),cf3(torderlim),STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocating Taylor variables! '
STOP
END IF
ALLOCATE(a(-2:torderlim,-2:torderlim,-2:torderlim),
& b(-2:torderlim,-2:torderlim,-2:torderlim),STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocating Taylor variables! '
STOP
END IF
a=0.0_r8
b=0.0_r8
DO i=0,torder
cf(i) = REAL(i,KIND=r8)+1.0_r8
END DO
DO i=1,torderlim
t1=1.0_r8/REAL(i,KIND=r8)
cf1(i)=t1
cf2(i)=1.0_r8-0.5_r8*t1
cf3(i)=1.0_r8-t1
END DO
C find bounds of Cartesian box enclosing the particles
xyzminmax(1)=MINVAL(x(1:numpars))
xyzminmax(2)=MAXVAL(x(1:numpars))
xyzminmax(3)=MINVAL(y(1:numpars))
xyzminmax(4)=MAXVAL(y(1:numpars))
xyzminmax(5)=MINVAL(z(1:numpars))
xyzminmax(6)=MAXVAL(z(1:numpars))
C#########################################################
ALLOCATE(orderarr(numpars),STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocating copy variables! '
STOP
END IF
DO i=1,numpars
orderarr(i)=i
END DO
RETURN
END SUBROUTINE SETUP
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
RECURSIVE SUBROUTINE CREATE_TREE(p,ibeg,iend,x,y,z,q,maxparnode,
& xyzmm,level,numpars)
IMPLICIT NONE
C
C CREATE_TREE recursively create the tree structure. Node P is
C input, which contains particles indexed from IBEG to IEND. After
C the node parameters are set subdivision occurs if IEND-IBEG+1 > MAXPARNODE.
C Real array XYZMM contains the min and max values of the coordinates
C of the particle in P, thus defining the box.
C
TYPE(tnode),POINTER :: p
INTEGER,INTENT(IN) :: ibeg,iend,level,maxparnode,numpars
REAL(KIND=r8),DIMENSION(numpars),INTENT(INOUT) :: x,y,z,q
REAL(KIND=r8),DIMENSION(6),INTENT(IN) :: xyzmm
C local variables
REAL(KIND=r8) :: x_mid,y_mid,z_mid,xl,yl,zl,lmax,t1,t2,t3
INTEGER, DIMENSION(8,2) :: ind
REAL(KIND=r8), DIMENSION(6,8) :: xyzmms
INTEGER :: i,j,limin,limax,err,loclev,numposchild
REAL(KIND=r8), DIMENSION(6) :: lxyzmm
C allocate pointer
ALLOCATE(p,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocating pointer! '
STOP
END IF
C set node fields: number of particles, exist_ms
C and xyz bounds
p%numpar=iend-ibeg+1
p%exist_ms=0
p%x_min=xyzmm(1)
p%x_max=xyzmm(2)
p%y_min=xyzmm(3)
p%y_max=xyzmm(4)
p%z_min=xyzmm(5)
p%z_max=xyzmm(6)
C compute aspect ratio
xl=p%x_max-p%x_min
yl=p%y_max-p%y_min
zl=p%z_max-p%z_min
lmax=MAX(xl,yl,zl)
t1=lmax
t2=MIN(xl,yl,zl)
IF (t2 .NE. 0.0_r8) THEN
p%aspect=t1/t2
ELSE
p%aspect=0.0_r8
END IF
C midpoint coordinates , RADIUS and SQRADIUS
p%x_mid=(p%x_max+p%x_min)/2.0_r8
p%y_mid=(p%y_max+p%y_min)/2.0_r8
p%z_mid=(p%z_max+p%z_min)/2.0_r8
t1=p%x_max-p%x_mid
t2=p%y_max-p%y_mid
t3=p%z_max-p%z_mid
p%radius=SQRT(t1*t1+t2*t2+t3*t3)
C set particle limits, tree level of node, and nullify children pointers
p%ibeg=ibeg
p%iend=iend
p%level=level
IF (maxlevel .LT. level) THEN
maxlevel=level
END IF
p%num_children=0
DO i=1,8
NULLIFY(p%child(i)%p_to_tnode)
END DO
IF (p%numpar .GT. maxparnode) THEN
C
C set IND array to 0 and then call PARTITION routine. IND array holds indices
C of the eight new subregions. Also, setup XYZMMS array in case SHRINK=1
C
xyzmms(1,1)=p%x_min
xyzmms(2,1)=p%x_max
xyzmms(3,1)=p%y_min
xyzmms(4,1)=p%y_max
xyzmms(5,1)=p%z_min
xyzmms(6,1)=p%z_max
ind=0
ind(1,1)=ibeg
ind(1,2)=iend
x_mid=p%x_mid
y_mid=p%y_mid
z_mid=p%z_mid
CALL PARTITION_8(x,y,z,q,xyzmms,xl,yl,zl,lmax,numposchild,
& x_mid,y_mid,z_mid,ind,numpars)
C########################################################
C Shrink the box
if (1==1) then
do i=1,8
if (ind(i,1) .le. ind(i,2)) then
xyzmms(1,i)=minval(x(ind(i,1):ind(i,2)))
xyzmms(2,i)=maxval(x(ind(i,1):ind(i,2)))
xyzmms(3,i)=minval(y(ind(i,1):ind(i,2)))
xyzmms(4,i)=maxval(y(ind(i,1):ind(i,2)))
xyzmms(5,i)=minval(z(ind(i,1):ind(i,2)))
xyzmms(6,i)=maxval(z(ind(i,1):ind(i,2)))
endif
end do
endif
C########################################################
C
C create children if indicated and store info in parent
C
loclev=level+1
DO i=1,numposchild
IF (ind(i,1) .LE. ind(i,2)) THEN
p%num_children=p%num_children+1
lxyzmm=xyzmms(:,i)
CALL CREATE_TREE(p%child(p%num_children)%p_to_tnode,
& ind(i,1),ind(i,2),x,y,z,q,
& maxparnode,lxyzmm,loclev,numpars)
END IF
END DO
ELSE
IF (level .LT. minlevel) THEN
minlevel=level
END IF
END IF
END SUBROUTINE CREATE_TREE
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE PARTITION_8(x,y,z,q,xyzmms,xl,yl,zl,lmax,numposchild,
& x_mid,y_mid,z_mid,ind,numpars)
IMPLICIT NONE
C
C PARTITION_8 determines the particle indices of the eight sub boxes
C containing the particles after the box defined by particles I_BEG
C to I_END is divided by its midpoints in each coordinate direction.
C The determination of the indices is accomplished by the subroutine
C PARTITION. A box is divided in a coordinate direction as long as the
C resulting aspect ratio is not too large. This avoids the creation of
C "narrow" boxes in which Talyor expansions may become inefficient.
C On exit the INTEGER array IND (dimension 8 x 2) contains
C the indice limits of each new box (node) and NUMPOSCHILD the number
C of possible children. If IND(J,1) > IND(J,2) for a given J this indicates
C that box J is empty.
C
INTEGER, INTENT(IN) :: numpars
REAL(KIND=r8),DIMENSION(numpars),INTENT(INOUT) :: x,y,z,q
INTEGER, DIMENSION(8,2),INTENT(INOUT) :: ind
REAL(KIND=r8),DIMENSION(6,8),INTENT(INOUT) :: xyzmms
REAL(KIND=r8), INTENT(IN) :: x_mid,y_mid,z_mid,xl,yl,zl,lmax
INTEGER,INTENT(INOUT) :: numposchild
C local variables
INTEGER :: temp_ind,i
REAL(KIND=r8) :: critlen
numposchild=1
critlen=lmax/sqrt(2.0_r8)
IF (xl .GE. critlen) THEN
CALL PARTITION(x,y,z,q,orderarr,ind(1,1),ind(1,2),
& x_mid,temp_ind,numpars)
ind(2,1)=temp_ind+1
ind(2,2)=ind(1,2)
ind(1,2)=temp_ind
xyzmms(:,2)=xyzmms(:,1)
xyzmms(2,1)=x_mid
xyzmms(1,2)=x_mid
numposchild=2*numposchild
END IF
IF (yl .GE. critlen) THEN
DO i=1,numposchild
CALL PARTITION(y,x,z,q,orderarr,ind(i,1),ind(i,2),
& y_mid,temp_ind,numpars)
ind(numposchild+i,1)=temp_ind+1
ind(numposchild+i,2)=ind(i,2)
ind(i,2)=temp_ind
xyzmms(:,numposchild+i)=xyzmms(:,i)
xyzmms(4,i)=y_mid
xyzmms(3,numposchild+i)=y_mid
END DO
numposchild=2*numposchild
END IF
IF (zl .GE. critlen) THEN
DO i=1,numposchild
CALL PARTITION(z,x,y,q,orderarr,ind(i,1),ind(i,2),
& z_mid,temp_ind,numpars)
ind(numposchild+i,1)=temp_ind+1
ind(numposchild+i,2)=ind(i,2)
ind(i,2)=temp_ind
xyzmms(:,numposchild+i)=xyzmms(:,i)
xyzmms(6,i)=z_mid
xyzmms(5,numposchild+i)=z_mid
END DO
numposchild=2*numposchild
END IF
RETURN
END SUBROUTINE PARTITION_8
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
RECURSIVE SUBROUTINE COMPP_TREE(p,peng,x,y,z,q,tpoten,kappa,theta,
& numpars,kk,eps,tempq,der_cof)
IMPLICIT NONE
INTEGER,INTENT(IN) :: numpars,kk(3,4)
TYPE(tnode),POINTER :: p
REAL(KIND=r8),INTENT(INOUT) :: peng
REAL(KIND=r8),DIMENSION(numpars),INTENT(IN) :: x,y,z
REAL(KIND=r8),DIMENSION(numpars,4),INTENT(IN) :: q
REAL(KIND=r8),DIMENSION(numpars),INTENT(IN) :: tpoten
REAL(KIND=r8),INTENT(IN):: kappa,theta,eps,tempq(4)
REAL(KIND=r8),INTENT(IN)::
& der_cof(0:torder2,0:torder2,0:torder2,4)
C local variables
REAL(KIND=r8) :: tx,ty,tz,dist,penglocal
real(kind=r8) :: SL(4),pt_comp(4)
INTEGER :: i,j,k,ijk(3),ikp,indx,err
C determine DISTSQ for MAC test
tx=p%x_mid-tarpos(1)
ty=p%y_mid-tarpos(2)
tz=p%z_mid-tarpos(3)
dist=SQRT(tx*tx+ty*ty+tz*tz)
C intialize potential energy and force
peng=0.0_r8
C If MAC is accepted and there is more than 1 particle in the
C box use the expansion for the approximation.
IF ((p%radius .LT. dist*theta) .AND.
& (p%numpar .GT. 40)) THEN
C@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
IF (p%exist_ms .EQ. 0) THEN
ALLOCATE(p%ms(4,0:torder,0:torder,0:torder),STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error allocating node moments! '
STOP
END IF
C#####################################################################
C Generate the moments if not allocated yet
CALL COMP_MS(p,x,y,z,q(:,:),numpars)
C#####################################################################
p%exist_ms=1
END IF
CALL COMPP_TREE_PB(kk,p,peng,kappa,theta,eps,tempq,der_cof)
C CALL COMPP_DIRECT_PB(penglocal,p%ibeg,p%iend,
C & x,y,z,tpoten,kappa,numpars,eps)
C write(*,*) peng(1),penglocal(1),(peng(1)-penglocal(1))/peng(1)
C write(*,*) peng(2),penglocal(2),(peng(2)-penglocal(2))/peng(2)
C pause
C peng=penglocal
ELSE
C If MAC fails check to see if there are children. If not, perform direct
C calculation. If there are children, call routine recursively for each.
C
IF (p%num_children .EQ. 0) THEN
CALL COMPP_DIRECT_PB(penglocal,p%ibeg,p%iend,
& x,y,z,tpoten,kappa,numpars,eps)
peng=penglocal
ELSE
DO i=1,p%num_children
CALL COMPP_TREE(p%child(i)%p_to_tnode,penglocal,x,y,z,q,
& tpoten,kappa,theta,numpars,kk,eps,tempq,der_cof)
peng=peng+penglocal
END DO
END IF
END IF
RETURN
END SUBROUTINE COMPP_TREE
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE COMPP_TREE_PB(kk,p,peng,kappa,theta,eps,tempq,der_cof)
IMPLICIT NONE
INTEGER,INTENT(IN) :: kk(3,4)
TYPE(tnode),POINTER :: p
REAL(KIND=r8),INTENT(INOUT) :: peng
C REAL(KIND=r8),DIMENSION(numpars),INTENT(IN) :: x,y,z
C REAL(KIND=r8),DIMENSION(numpars,16,2),INTENT(IN) :: q
C REAL(KIND=r8),DIMENSION(2*numpars),INTENT(IN) :: tpoten
REAL(KIND=r8),INTENT(IN):: kappa,theta,eps,tempq(4),
& der_cof(0:torder2,0:torder2,0:torder2,4)
C local variables
real(kind=r8) :: SL(4),pt_comp(4)
INTEGER :: i,j,k,ikp,indx,kk1,kk2,kk3
!do ikp=1,2
C Get the fundermental solution of Poisson equation and PB equation
CALL COMP_TCOEFF(p)
do indx=2,4
peng=0.0d0
DO k=0,torder2
DO j=0,torder2-k
DO i=0,torder2-k-j
peng=peng+der_cof(i,j,k,indx)
& *a(i+kk(1,indx),j+kk(2,indx),k+kk(3,indx))
& *p%ms(indx,i,j,k)
END DO
END DO
END DO
pt_comp(indx)=tempq(indx)*peng
enddo
peng=-sum(pt_comp(2:4))
END SUBROUTINE COMPP_TREE_PB
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE COMP_TCOEFF(p)
IMPLICIT NONE
C
C COMP_TCOEFF computes the Taylor coefficients of the potential
C using a recurrence formula. The center of the expansion is the
C midpoint of the node P. TARPOS and TORDERLIM are globally defined.
C
TYPE(tnode),POINTER :: p
C local varaibles
REAL(KIND=r8) :: dx,dy,dz,ddx,ddy,ddz,dist,fac
INTEGER :: i,j,k
C setup variables
dx=tarpos(1)-p%x_mid
dy=tarpos(2)-p%y_mid
dz=tarpos(3)-p%z_mid
ddx=2.0_r8*dx
ddy=2.0_r8*dy
ddz=2.0_r8*dz
dist=dx*dx+dy*dy+dz*dz
fac=1.0_r8/dist
dist=SQRT(dist)
C 0th coeff or function val
a(0,0,0)=1.d0/dist
C 2 indices are 0
a(1,0,0)=fac*dx*a(0,0,0)
a(0,1,0)=fac*dy*a(0,0,0)
a(0,0,1)=fac*dz*a(0,0,0)
DO i=2,torderlim
a(i,0,0)=fac*(ddx*cf2(i)*a(i-1,0,0)-cf3(i)*a(i-2,0,0))
a(0,i,0)=fac*(ddy*cf2(i)*a(0,i-1,0)-cf3(i)*a(0,i-2,0))
a(0,0,i)=fac*(ddz*cf2(i)*a(0,0,i-1)-cf3(i)*a(0,0,i-2))
END DO
C 1 index 0, 1 index 1, other >=1
a(1,1,0)=fac*(dx*a(0,1,0)+ddy*a(1,0,0))
a(1,0,1)=fac*(dx*a(0,0,1)+ddz*a(1,0,0))
a(0,1,1)=fac*(dy*a(0,0,1)+ddz*a(0,1,0))
DO i=2,torderlim-1
a(1,0,i)=fac*(dx*a(0,0,i)+ddz*a(1,0,i-1)-a(1,0,i-2))
a(0,1,i)=fac*(dy*a(0,0,i)+ddz*a(0,1,i-1)-a(0,1,i-2))
a(0,i,1)=fac*(dz*a(0,i,0)+ddy*a(0,i-1,1)-a(0,i-2,1))
a(1,i,0)=fac*(dx*a(0,i,0)+ddy*a(1,i-1,0)-a(1,i-2,0))
a(i,1,0)=fac*(dy*a(i,0,0)+ddx*a(i-1,1,0)-a(i-2,1,0))
a(i,0,1)=fac*(dz*a(i,0,0)+ddx*a(i-1,0,1)-a(i-2,0,1))
END DO
C 1 index 0, others >= 2
DO i=2,torderlim-2
DO j=2,torderlim-i
a(i,j,0)=fac*(ddx*cf2(i)*a(i-1,j,0)+ddy*a(i,j-1,0)
& -cf3(i)*a(i-2,j,0)-a(i,j-2,0))
a(i,0,j)=fac*(ddx*cf2(i)*a(i-1,0,j)+ddz*a(i,0,j-1)
& -cf3(i)*a(i-2,0,j)-a(i,0,j-2))
a(0,i,j)=fac*(ddy*cf2(i)*a(0,i-1,j)+ddz*a(0,i,j-1)
& -cf3(i)*a(0,i-2,j)-a(0,i,j-2))
END DO
END DO
C 2 indices 1, other >= 1
a(1,1,1)=fac*(dx*a(0,1,1)+ddy*a(1,0,1)+ddz*a(1,1,0))
DO i=2,torderlim-2
a(1,1,i)=fac*(dx*a(0,1,i)+ddy*a(1,0,i)+ddz*a(1,1,i-1)
& -a(1,1,i-2))
a(1,i,1)=fac*(dx*a(0,i,1)+ddy*a(1,i-1,1)+ddz*a(1,i,0)
& -a(1,i-2,1))
a(i,1,1)=fac*(dy*a(i,0,1)+ddx*a(i-1,1,1)+ddz*a(i,1,0)
& -a(i-2,1,1))
END DO
C 1 index 1, others >=2
DO i=2,torderlim-3
DO j=2,torderlim-i
a(1,i,j)=fac*(dx*a(0,i,j)+ddy*a(1,i-1,j)+ddz*a(1,i,j-1)
& -a(1,i-2,j)-a(1,i,j-2))
a(i,1,j)=fac*(dy*a(i,0,j)+ddx*a(i-1,1,j)+ddz*a(i,1,j-1)
& -a(i-2,1,j)-a(i,1,j-2))
a(i,j,1)=fac*(dz*a(i,j,0)+ddx*a(i-1,j,1)+ddy*a(i,j-1,1)
& -a(i-2,j,1)-a(i,j-2,1))
END DO
END DO
C all indices >=2
DO k=2,torderlim-4
DO j=2,torderlim-2-k
DO i=2,torderlim-k-j
a(i,j,k)=fac*(ddx*cf2(i)*a(i-1,j,k)+ddy*a(i,j-1,k)
& +ddz*a(i,j,k-1)-cf3(i)*a(i-2,j,k)
& -a(i,j-2,k)-a(i,j,k-2))
END DO
END DO
END DO
RETURN
END SUBROUTINE COMP_TCOEFF
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE COMP_MS(p,x,y,z,q,numpars)
IMPLICIT NONE
C
C COMP_MS computes the moments for node P needed in the Taylor approximation
C
INTEGER,INTENT(IN) :: numpars
TYPE(tnode),POINTER :: p
REAL(KIND=r8),DIMENSION(numpars),INTENT(IN) :: x,y,z
C##################################################################
REAL(KIND=r8),DIMENSION(numpars,4),INTENT(IN) ::q
C##################################################################
C local variables
INTEGER :: i,k1,k2,k3,j
REAL(KIND=r8) :: dx,dy,dz,tx,ty,tz,txyz
p%ms=0.0_r8
DO i=p%ibeg,p%iend
dx=x(i)-p%x_mid
dy=y(i)-p%y_mid
dz=z(i)-p%z_mid
tz=1.0_r8
DO k3=0,torder
ty=1.0_r8
DO k2=0,torder-k3
tx=1.0_r8
DO k1=0,torder-k3-k2
C####################################################################
txyz=tx*ty*tz
p%ms(2:4,k1,k2,k3)=p%ms(2:4,k1,k2,k3)+q(i,2:4)*txyz
C####################################################################
tx=tx*dx
END DO
ty=ty*dy
END DO
tz=tz*dz
END DO
END DO
C####################################################################
RETURN
END SUBROUTINE COMP_MS
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE COMPP_DIRECT_PB(peng,ibeg,iend,x,y,z,
& tpoten,kappa,numpars,eps)
use treecode, only: tr_area,tr_q
IMPLICIT NONE
real*8, external:: H1,H2,H3,H4
C
C COMPF_DIRECT directly computes the force on the current target
C particle determined by the global variable TARPOS.
C
INTEGER,INTENT(IN) :: ibeg,iend,numpars
REAL*8,DIMENSION(numpars),INTENT(IN) :: x,y,z
REAL*8,DIMENSION(numpars),INTENT(IN) :: tpoten
REAL*8,INTENT(IN) :: kappa,eps
REAL*8,INTENT(OUT) :: peng
C local variables
INTEGER :: j
REAL*8 :: dist2,dist,tx,ty,tz,soupos(3),souq(3)
real*8 :: peng_old,L1,L2,L3,L4, area,temp_area
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
real*8 :: r(3),s(3),v(3),v0(3),pi,rs,cos_theta,cos_theta0,kappa_rs
real*8 :: G0,Gk,G10,G20,G1,G2,G3,G4,one_over_4pi,exp_kappa_rs
real*8 :: tp1,tp2,tp3
common // pi,one_over_4pi
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
peng=0.0_r8
DO j=ibeg,iend
C###########################################
C The following content has to be precisely fast
C Since it is the part called most
!soupos=(/x(j),y(j),z(j)/)
!souq=tr_q(:,j)
C###########################################
C Temperarily delete the singular part
C if (dist <1.d-10) then
C goto 1022
C endif
C############################################
C L1=H1(souq,soupos,tarpos,eps,kappa)
C L2=H2(soupos,tarpos,kappa)
C L3=H3(tarq,souq,soupos,tarpos,kappa)
C L4=H4(tarq,soupos,tarpos,kappa,eps)
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
r=(/x(j),y(j),z(j)/)
v=tr_q(:,j)
s=tarpos
v0=tarq
rs=sqrt(dot_product(r-s,r-s))
G0=one_over_4pi/rs
!cos_theta=dot_product(v,r-s)/rs
cos_theta0=dot_product(v0,r-s)/rs
tp1=G0/rs
!G1=cos_theta*tp1
G10=cos_theta0*tp1
peng=peng+G10*tpoten(j)*tr_area(j)
C#############################################
!1022 continue
END DO
!print *,'finishing direct computing peng:= ', peng
RETURN
END SUBROUTINE COMPP_DIRECT_PB
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE CLEANUP(p)
IMPLICIT NONE
C
C CLEANUP deallocates allocated global variables and then
C calls recursive routine REMOVE_NODE to delete the tree.
C
TYPE(tnode),POINTER :: p
C local variables
INTEGER :: err
DEALLOCATE(cf, STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating Taylor variables! '
STOP
END IF
DEALLOCATE(cf1,cf2,cf3,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating Taylor variables! '
STOP
END IF
DEALLOCATE(a,b,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating Taylor variables! '
STOP
END IF
DEALLOCATE(xcopy,ycopy,zcopy,qcopy,orderarr,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating copy variables! '
STOP
END IF
CALL REMOVE_NODE(p)
DEALLOCATE(p, STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating root node! '
STOP
END IF
NULLIFY(p)
RETURN
END SUBROUTINE CLEANUP
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
RECURSIVE SUBROUTINE REMOVE_NODE(p)
IMPLICIT NONE
C
C REMOVE_NODE recursively removes each node from the
C tree and deallocates its memory for MS array if it
C exits.
C
TYPE(tnode),POINTER :: p
C local variables
INTEGER :: i,err
IF (p%exist_ms .EQ. 1) THEN
DEALLOCATE(p%ms,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating node MS! '
STOP
END IF
END IF
IF (p%num_children .GT. 0) THEN
DO i=1,p%num_children
CALL REMOVE_NODE(p%child(i)%p_to_tnode)
DEALLOCATE(p%child(i)%p_to_tnode,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating node child! '
STOP
END IF
END DO
END IF
RETURN
END SUBROUTINE REMOVE_NODE
C#######################################################################
RECURSIVE SUBROUTINE REMOVE_MMT(p)
IMPLICIT NONE
C
C REMOVE_NODE recursively removes each node from the
C tree and deallocates its memory for MS array if it
C exits.
C
TYPE(tnode),POINTER :: p
C local variables
INTEGER :: i,err
IF (p%exist_ms .EQ. 1) THEN
DEALLOCATE(p%ms,STAT=err)
IF (err .NE. 0) THEN
WRITE(6,*) 'Error deallocating node MS! '
STOP
END IF
C########################
p%exist_ms=0
C########################
END IF
IF (p%num_children .GT. 0) THEN
DO i=1,p%num_children
CALL REMOVE_MMT(p%child(i)%p_to_tnode)
END DO
END IF
RETURN
END SUBROUTINE REMOVE_MMT
C ##################################################################################################
SUBROUTINE TREE_COMPP_PB(p,kappa,eps,tpoten)
use treecode
IMPLICIT NONE
C
C TREE_COMPF is the driver routine which calls COMPF_TREE for each
C particle, setting the global variable TARPOS and TARCHR before the call.
C The current target particle's x coordinate and charge are changed
C so that it does not interact with itself. P is the root node of the tree.
C
TYPE(tnode),POINTER :: p
C REAL(KIND=r8),DIMENSION(numpars),INTENT(INOUT) :: tpoten
REAL*8 :: kappa,eps
REAL*8 :: tpoten(numpars)
C local variables
INTEGER :: i,j,ikp,indx,kkk(3)
REAL*8 :: peng,tempx,temp_area,sL(4),tpoten_old(numpars)
REAL*8 :: pt_comp(numpars,4), kapa,time1,time2,tempq(4)
REAL*8 :: pre1,pre2,pre3
print *,'entering TREE_COMPP_PB'
pre1=0.5d0*(1.d0+eps)
pre2=0.5d0*(1.d0+1.d0/eps)
pre3=(1-1.d0/eps)
tpoten_old=tpoten
call pb_kernel(tpoten_old)
DO i=1,numpars
tarpos(1)=x(i)
tarpos(2)=y(i)
tarpos(3)=z(i)
tarq=tr_q(:,i)
tempq=tchg(i,:)
peng_old=tpoten_old(i)
!peng_old(2)=tpoten_old(i+numpars)
peng=0.d0
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
C Remove the singularities
tempx=x(i)
temp_area=tr_area(i)
x(i)=x(i)+100.123456789d0
tr_area(i)=0.d0
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
CALL COMPP_TREE(p,peng,x,y,z,schg,tpoten_old,
& kappa,theta,numpars,kk,eps,tempq,der_cof)
tpoten(i)=pre2*peng_old-pre3*peng
!tpoten(numpars+i)=pre2*peng_old(2)-peng(2)
C call cpu_time(time2)
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
x(i)=tempx
tr_area(i)=temp_area
C%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
C print *,'cpu time for one p-c intercation: ',i,real(time2-time1)
ENDDO
RETURN
END SUBROUTINE TREE_COMPP_PB
END MODULE treecode3d_procedures
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
SUBROUTINE PARTITION(a,b,c,q,indarr,ibeg,iend,val,midind,numpars)
IMPLICIT NONE
C
C PARTITION determines the index MIDIND, after partitioning
C in place the arrays A,B,C and Q, such that
C A(IBEG:MIDIND) <= VAL and A(MIDIND+1:IEND) > VAL.
C If on entry IBEG > IEND or A(IBEG:IEND) > VAL then MIDIND
C is returned as IBEG-1.
C
INTEGER,PARAMETER :: r8=SELECTED_REAL_KIND(12)
INTEGER, INTENT(IN) :: numpars,ibeg,iend
REAL(KIND=r8),DIMENSION(numpars),INTENT(INOUT) :: a,b,c,q
INTEGER,DIMENSION(numpars),INTENT(INOUT) :: indarr
C INTEGER,DIMENSION(1),INTENT(INOUT) :: indarr
INTEGER, INTENT(INOUT) :: midind
REAL(KIND=r8) val
C local variables
REAL(KIND=r8) ta,tb,tc,tq
INTEGER lower,upper,tind
IF (ibeg .LT. iend) THEN
C temporarily store IBEG entries and set A(IBEG)=VAL for
C the partitoning algorithm.
ta=a(ibeg)
tb=b(ibeg)
tc=c(ibeg)
tq=q(ibeg)
tind=indarr(ibeg)
a(ibeg)=val
upper=ibeg
lower=iend
DO WHILE (upper .NE. lower)
DO WHILE ((upper .LT. lower) .AND. (val .LT. a(lower)))
lower=lower-1
END DO
IF (upper .NE. lower) THEN
a(upper)=a(lower)
b(upper)=b(lower)
c(upper)=c(lower)
q(upper)=q(lower)
indarr(upper)=indarr(lower)
END IF
DO WHILE ((upper .LT. lower) .AND. (val .GE. a(upper)))
upper=upper+1
END DO
IF (upper .NE. lower) THEN
a(lower)=a(upper)
b(lower)=b(upper)
c(lower)=c(upper)
q(lower)=q(upper)
indarr(lower)=indarr(upper)
END IF
END DO
midind=upper
C replace TA in position UPPER and change MIDIND if TA > VAL
IF (ta .GT. val) THEN
midind=upper-1
END IF
a(upper)=ta
b(upper)=tb
c(upper)=tc
q(upper)=tq
indarr(upper)=tind
ELSEIF (ibeg .EQ. iend) THEN
IF (a(ibeg) .LE. val) THEN
midind=ibeg
ELSE
midind=ibeg-1
END IF
ELSE
midind=ibeg-1
END IF
RETURN
END SUBROUTINE PARTITION