Another optimization
This commit is contained in:
parent
eef8f32ea9
commit
31d6086cb0
|
|
@ -8,7 +8,7 @@ V1 = -8.6
|
||||||
R1 = 1.75
|
R1 = 1.75
|
||||||
V2 = 3.4
|
V2 = 3.4
|
||||||
R2 = 3.2
|
R2 = 3.2
|
||||||
n_max = 20
|
n_max = 30
|
||||||
|
|
||||||
ns = collect(0:n_max)
|
ns = collect(0:n_max)
|
||||||
ls = fill(l, n_max + 1)
|
ls = fill(l, n_max + 1)
|
||||||
|
|
|
||||||
|
|
@ -2,10 +2,11 @@ using NuclearToolkit
|
||||||
using SpecialFunctions
|
using SpecialFunctions
|
||||||
|
|
||||||
# Gaussian potentials in HO space
|
# Gaussian potentials in HO space
|
||||||
|
inv_factorial(n) = Iterators.prod(inv.(1:n))
|
||||||
sqrt_factorial(n) = Iterators.prod(sqrt.(n:-1:1))
|
sqrt_factorial(n) = Iterators.prod(sqrt.(n:-1:1))
|
||||||
sqrt_double_factorial(n) = Iterators.prod(sqrt.(n:-2:1))
|
sqrt_double_factorial(n) = Iterators.prod(sqrt.(n:-2:1))
|
||||||
N_nl(n, l) = (-1)^n * sqrt_factorial(n) * sqrt(1/sqrt(pi) * 2^(n+l+2)) / sqrt_double_factorial(2*n+2*l+1)
|
N_nl(n, l) = (-1)^n * sqrt_factorial(n) * sqrt(1/sqrt(pi) * 2^(n+l+2)) / sqrt_double_factorial(2*n+2*l+1)
|
||||||
prefactor(n, l, k) = (-1)^k * binomial(n + l + 1/2, n - k) / factorial(k)
|
prefactor(n, l, k) = (-1)^k * binomial(n + l + 1/2, n - k) * inv_factorial(k)
|
||||||
Talmi(l, R, k1, k2) = (1/2) / (1 + 1/R^2)^(3/2 + l + k1 + k2) * gamma(3/2 + l + k1 + k2)
|
Talmi(l, R, k1, k2) = (1/2) / (1 + 1/R^2)^(3/2 + l + k1 + k2) * gamma(3/2 + l + k1 + k2)
|
||||||
V_Gaussian(R, l, n1, n2) = N_nl(n1, l) * N_nl(n2, l) * sum([prefactor(n1, l, k1) * prefactor(n2, l, k2) * Talmi(l, R, k1, k2) for (k1, k2) in Iterators.product(0:n1, 0:n2)])
|
V_Gaussian(R, l, n1, n2) = N_nl(n1, l) * N_nl(n2, l) * sum([prefactor(n1, l, k1) * prefactor(n2, l, k2) * Talmi(l, R, k1, k2) for (k1, k2) in Iterators.product(0:n1, 0:n2)])
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue