擅长:python、mysql、java
<p>所以,我想出来了。嗯,有点。现在代码的计算量非常大。但它至少有效。它在下面。在</p>
<pre><code>import math
from scipy import *
from scipy.special import expi
import numpy as np
t_f =100
N_0 = 10
t = [0,]
n = [N_0,]
r = 2.5
K = 100
N_t = [N_0,]
for i in range(0,100):
a= i*math.exp(r) + expi(r/K * N_0)
n.append(a)
t.append(i+1)
g = np.arange(0,1000,0.0001)
d = []
e = []
for i in g:
x = expi(i)
d.append(x)
e.append(i)
for j in range(1,99):
b = n[j]
c = []
for i in g:
c.append(b)
t = np.subtract(d,c)
for i in range(len(t) - 1):
if t[i] == 0. or t[i] * t[i + 1] < 0.:
y = e[i]
print(y)
N_next = math.floor(y*K/r)
N_t.append(N_next)
print(N_t)
plot(t,N_t)
</code></pre>