LCPQ/qp2
9
1
Fork 0
mirror of https://github.com/QuantumPackage/qp2.git synced 2024-12-22 03:23:29 +01:00
Code Releases Activity

Fix CSF

Browse Source
This commit is contained in:
Anthony Scemama 2022-02-07 11:02:54 +01:00
parent 753399f40c
commit 64d80fd273
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/csf/conversion.irp.f
View File

@ -58,19 +58,19 @@ subroutine convertWFfromDETtoCSF(N_st,psi_coef_det_in, psi_coef_cfg_out)
enddo enddo
enddo enddo
s = 0 s = 0 ! s == total number of SOMOs
do k=1,N_int do k=1,N_int
if (psi_configuration(k,1,i) == 0_bit_kind) cycle if (psi_configuration(k,1,i) == 0_bit_kind) cycle
s = s + popcnt(psi_configuration(k,1,i)) s = s + popcnt(psi_configuration(k,1,i))
enddo enddo
bfIcfg = max(1,nint((binom(s,(s+1)/2)-binom(s,((s+1)/2)+1)))) bfIcfg = max(1,nint((binom(s,(s+1)/2)-binom(s,((s+1)/2)+1))))
! ! Test 1 if(iand(s,1) .EQ. 0) then
! if(iand(MS,1) .EQ. 0) then bfIcfg = max(1,nint((binom(s,s/2)-binom(s,(s/2)+1))))
! bfIcfg = max(1,nint((binom(s,s/2)-binom(s,s/2+1)))) else
! else bfIcfg = max(1,nint((binom(s,(s+1)/2)-binom(s,((s+1)/2)+1))))
! bfIcfg = max(1,nint((binom(s,(s+1)/2)-binom(s,((s+1)/2)+1)))) endif
! endif
! perhaps blocking with CFGs of same seniority ! perhaps blocking with CFGs of same seniority
! can be more efficient ! can be more efficient